@hkyhy/marsun-components-core 0.1.113 → 0.1.114

package/dist/node_modules/@antv/layout/lib/node_modules/ml-matrix/matrix2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix2.js","sources":["../../../../../../../node_modules/@antv/layout/lib/node_modules/ml-matrix/matrix2.js"],"sourcesContent":["import { __exports as matrix } from '../../_virtual/matrix2.js';\nimport require$$0 from '../../_virtual/index2.js';\nimport require$$1 from '../../_virtual/index3.js';\n\nvar hasRequiredMatrix;\n\nfunction requireMatrix () {\n\tif (hasRequiredMatrix) return matrix;\n\thasRequiredMatrix = 1;\n\n\tObject.defineProperty(matrix, '__esModule', { value: true });\n\n\tvar isAnyArray = require$$0;\n\tvar rescale = require$$1;\n\n\tconst indent = ' '.repeat(2);\n\tconst indentData = ' '.repeat(4);\n\n\t/**\n\t * @this {Matrix}\n\t * @returns {string}\n\t */\n\tfunction inspectMatrix() {\n\t  return inspectMatrixWithOptions(this);\n\t}\n\n\tfunction inspectMatrixWithOptions(matrix, options = {}) {\n\t  const {\n\t    maxRows = 15,\n\t    maxColumns = 10,\n\t    maxNumSize = 8,\n\t    padMinus = 'auto',\n\t  } = options;\n\t  return `${matrix.constructor.name} {\n${indent}[\n${indentData}${inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus)}\n${indent}]\n${indent}rows: ${matrix.rows}\n${indent}columns: ${matrix.columns}\n}`;\n\t}\n\n\tfunction inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus) {\n\t  const { rows, columns } = matrix;\n\t  const maxI = Math.min(rows, maxRows);\n\t  const maxJ = Math.min(columns, maxColumns);\n\t  const result = [];\n\n\t  if (padMinus === 'auto') {\n\t    padMinus = false;\n\t    loop: for (let i = 0; i < maxI; i++) {\n\t      for (let j = 0; j < maxJ; j++) {\n\t        if (matrix.get(i, j) < 0) {\n\t          padMinus = true;\n\t          break loop;\n\t        }\n\t      }\n\t    }\n\t  }\n\n\t  for (let i = 0; i < maxI; i++) {\n\t    let line = [];\n\t    for (let j = 0; j < maxJ; j++) {\n\t      line.push(formatNumber(matrix.get(i, j), maxNumSize, padMinus));\n\t    }\n\t    result.push(`${line.join(' ')}`);\n\t  }\n\t  if (maxJ !== columns) {\n\t    result[result.length - 1] += ` ... ${columns - maxColumns} more columns`;\n\t  }\n\t  if (maxI !== rows) {\n\t    result.push(`... ${rows - maxRows} more rows`);\n\t  }\n\t  return result.join(`\\n${indentData}`);\n\t}\n\n\tfunction formatNumber(num, maxNumSize, padMinus) {\n\t  return (\n\t    num >= 0 && padMinus\n\t      ? ` ${formatNumber2(num, maxNumSize - 1)}`\n\t      : formatNumber2(num, maxNumSize)\n\t  ).padEnd(maxNumSize);\n\t}\n\n\tfunction formatNumber2(num, len) {\n\t  // small.length numbers should be as is\n\t  let str = num.toString();\n\t  if (str.length <= len) return str;\n\n\t  // (7)'0.00123' is better then (7)'1.23e-2'\n\t  // (8)'0.000123' is worse then (7)'1.23e-3',\n\t  let fix = num.toFixed(len);\n\t  if (fix.length > len) {\n\t    fix = num.toFixed(Math.max(0, len - (fix.length - len)));\n\t  }\n\t  if (\n\t    fix.length <= len &&\n\t    !fix.startsWith('0.000') &&\n\t    !fix.startsWith('-0.000')\n\t  ) {\n\t    return fix;\n\t  }\n\n\t  // well, if it's still too long the user should've used longer numbers\n\t  let exp = num.toExponential(len);\n\t  if (exp.length > len) {\n\t    exp = num.toExponential(Math.max(0, len - (exp.length - len)));\n\t  }\n\t  return exp.slice(0);\n\t}\n\n\tfunction installMathOperations(AbstractMatrix, Matrix) {\n\t  AbstractMatrix.prototype.add = function add(value) {\n\t    if (typeof value === 'number') return this.addS(value);\n\t    return this.addM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.addS = function addS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) + value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.addM = function addM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) + matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.add = function add(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.add(value);\n\t  };\n\n\t  AbstractMatrix.prototype.sub = function sub(value) {\n\t    if (typeof value === 'number') return this.subS(value);\n\t    return this.subM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.subS = function subS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) - value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.subM = function subM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) - matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.sub = function sub(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.sub(value);\n\t  };\n\t  AbstractMatrix.prototype.subtract = AbstractMatrix.prototype.sub;\n\t  AbstractMatrix.prototype.subtractS = AbstractMatrix.prototype.subS;\n\t  AbstractMatrix.prototype.subtractM = AbstractMatrix.prototype.subM;\n\t  AbstractMatrix.subtract = AbstractMatrix.sub;\n\n\t  AbstractMatrix.prototype.mul = function mul(value) {\n\t    if (typeof value === 'number') return this.mulS(value);\n\t    return this.mulM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.mulS = function mulS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) * value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.mulM = function mulM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) * matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.mul = function mul(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.mul(value);\n\t  };\n\t  AbstractMatrix.prototype.multiply = AbstractMatrix.prototype.mul;\n\t  AbstractMatrix.prototype.multiplyS = AbstractMatrix.prototype.mulS;\n\t  AbstractMatrix.prototype.multiplyM = AbstractMatrix.prototype.mulM;\n\t  AbstractMatrix.multiply = AbstractMatrix.mul;\n\n\t  AbstractMatrix.prototype.div = function div(value) {\n\t    if (typeof value === 'number') return this.divS(value);\n\t    return this.divM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.divS = function divS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) / value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.divM = function divM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) / matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.div = function div(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.div(value);\n\t  };\n\t  AbstractMatrix.prototype.divide = AbstractMatrix.prototype.div;\n\t  AbstractMatrix.prototype.divideS = AbstractMatrix.prototype.divS;\n\t  AbstractMatrix.prototype.divideM = AbstractMatrix.prototype.divM;\n\t  AbstractMatrix.divide = AbstractMatrix.div;\n\n\t  AbstractMatrix.prototype.mod = function mod(value) {\n\t    if (typeof value === 'number') return this.modS(value);\n\t    return this.modM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.modS = function modS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) % value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.modM = function modM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) % matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.mod = function mod(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.mod(value);\n\t  };\n\t  AbstractMatrix.prototype.modulus = AbstractMatrix.prototype.mod;\n\t  AbstractMatrix.prototype.modulusS = AbstractMatrix.prototype.modS;\n\t  AbstractMatrix.prototype.modulusM = AbstractMatrix.prototype.modM;\n\t  AbstractMatrix.modulus = AbstractMatrix.mod;\n\n\t  AbstractMatrix.prototype.and = function and(value) {\n\t    if (typeof value === 'number') return this.andS(value);\n\t    return this.andM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.andS = function andS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) & value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.andM = function andM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) & matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.and = function and(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.and(value);\n\t  };\n\n\t  AbstractMatrix.prototype.or = function or(value) {\n\t    if (typeof value === 'number') return this.orS(value);\n\t    return this.orM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.orS = function orS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) | value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.orM = function orM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) | matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.or = function or(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.or(value);\n\t  };\n\n\t  AbstractMatrix.prototype.xor = function xor(value) {\n\t    if (typeof value === 'number') return this.xorS(value);\n\t    return this.xorM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.xorS = function xorS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) ^ value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.xorM = function xorM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) ^ matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.xor = function xor(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.xor(value);\n\t  };\n\n\t  AbstractMatrix.prototype.leftShift = function leftShift(value) {\n\t    if (typeof value === 'number') return this.leftShiftS(value);\n\t    return this.leftShiftM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.leftShiftS = function leftShiftS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) << value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.leftShiftM = function leftShiftM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) << matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.leftShift = function leftShift(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.leftShift(value);\n\t  };\n\n\t  AbstractMatrix.prototype.signPropagatingRightShift = function signPropagatingRightShift(value) {\n\t    if (typeof value === 'number') return this.signPropagatingRightShiftS(value);\n\t    return this.signPropagatingRightShiftM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.signPropagatingRightShiftS = function signPropagatingRightShiftS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) >> value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.signPropagatingRightShiftM = function signPropagatingRightShiftM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) >> matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.signPropagatingRightShift = function signPropagatingRightShift(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.signPropagatingRightShift(value);\n\t  };\n\n\t  AbstractMatrix.prototype.rightShift = function rightShift(value) {\n\t    if (typeof value === 'number') return this.rightShiftS(value);\n\t    return this.rightShiftM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.rightShiftS = function rightShiftS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) >>> value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.rightShiftM = function rightShiftM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) >>> matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.rightShift = function rightShift(matrix, value) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.rightShift(value);\n\t  };\n\t  AbstractMatrix.prototype.zeroFillRightShift = AbstractMatrix.prototype.rightShift;\n\t  AbstractMatrix.prototype.zeroFillRightShiftS = AbstractMatrix.prototype.rightShiftS;\n\t  AbstractMatrix.prototype.zeroFillRightShiftM = AbstractMatrix.prototype.rightShiftM;\n\t  AbstractMatrix.zeroFillRightShift = AbstractMatrix.rightShift;\n\n\t  AbstractMatrix.prototype.not = function not() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, ~(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.not = function not(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.not();\n\t  };\n\n\t  AbstractMatrix.prototype.abs = function abs() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.abs(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.abs = function abs(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.abs();\n\t  };\n\n\t  AbstractMatrix.prototype.acos = function acos() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.acos(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.acos = function acos(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.acos();\n\t  };\n\n\t  AbstractMatrix.prototype.acosh = function acosh() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.acosh(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.acosh = function acosh(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.acosh();\n\t  };\n\n\t  AbstractMatrix.prototype.asin = function asin() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.asin(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.asin = function asin(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.asin();\n\t  };\n\n\t  AbstractMatrix.prototype.asinh = function asinh() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.asinh(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.asinh = function asinh(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.asinh();\n\t  };\n\n\t  AbstractMatrix.prototype.atan = function atan() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.atan(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.atan = function atan(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.atan();\n\t  };\n\n\t  AbstractMatrix.prototype.atanh = function atanh() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.atanh(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.atanh = function atanh(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.atanh();\n\t  };\n\n\t  AbstractMatrix.prototype.cbrt = function cbrt() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.cbrt(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.cbrt = function cbrt(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.cbrt();\n\t  };\n\n\t  AbstractMatrix.prototype.ceil = function ceil() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.ceil(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.ceil = function ceil(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.ceil();\n\t  };\n\n\t  AbstractMatrix.prototype.clz32 = function clz32() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.clz32(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.clz32 = function clz32(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.clz32();\n\t  };\n\n\t  AbstractMatrix.prototype.cos = function cos() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.cos(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.cos = function cos(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.cos();\n\t  };\n\n\t  AbstractMatrix.prototype.cosh = function cosh() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.cosh(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.cosh = function cosh(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.cosh();\n\t  };\n\n\t  AbstractMatrix.prototype.exp = function exp() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.exp(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.exp = function exp(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.exp();\n\t  };\n\n\t  AbstractMatrix.prototype.expm1 = function expm1() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.expm1(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.expm1 = function expm1(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.expm1();\n\t  };\n\n\t  AbstractMatrix.prototype.floor = function floor() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.floor(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.floor = function floor(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.floor();\n\t  };\n\n\t  AbstractMatrix.prototype.fround = function fround() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.fround(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.fround = function fround(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.fround();\n\t  };\n\n\t  AbstractMatrix.prototype.log = function log() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.log(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.log = function log(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.log();\n\t  };\n\n\t  AbstractMatrix.prototype.log1p = function log1p() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.log1p(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.log1p = function log1p(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.log1p();\n\t  };\n\n\t  AbstractMatrix.prototype.log10 = function log10() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.log10(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.log10 = function log10(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.log10();\n\t  };\n\n\t  AbstractMatrix.prototype.log2 = function log2() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.log2(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.log2 = function log2(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.log2();\n\t  };\n\n\t  AbstractMatrix.prototype.round = function round() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.round(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.round = function round(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.round();\n\t  };\n\n\t  AbstractMatrix.prototype.sign = function sign() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.sign(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.sign = function sign(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.sign();\n\t  };\n\n\t  AbstractMatrix.prototype.sin = function sin() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.sin(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.sin = function sin(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.sin();\n\t  };\n\n\t  AbstractMatrix.prototype.sinh = function sinh() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.sinh(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.sinh = function sinh(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.sinh();\n\t  };\n\n\t  AbstractMatrix.prototype.sqrt = function sqrt() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.sqrt(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.sqrt = function sqrt(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.sqrt();\n\t  };\n\n\t  AbstractMatrix.prototype.tan = function tan() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.tan(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.tan = function tan(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.tan();\n\t  };\n\n\t  AbstractMatrix.prototype.tanh = function tanh() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.tanh(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.tanh = function tanh(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.tanh();\n\t  };\n\n\t  AbstractMatrix.prototype.trunc = function trunc() {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, Math.trunc(this.get(i, j)));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.trunc = function trunc(matrix) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.trunc();\n\t  };\n\n\t  AbstractMatrix.pow = function pow(matrix, arg0) {\n\t    const newMatrix = new Matrix(matrix);\n\t    return newMatrix.pow(arg0);\n\t  };\n\n\t  AbstractMatrix.prototype.pow = function pow(value) {\n\t    if (typeof value === 'number') return this.powS(value);\n\t    return this.powM(value);\n\t  };\n\n\t  AbstractMatrix.prototype.powS = function powS(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) ** value);\n\t      }\n\t    }\n\t    return this;\n\t  };\n\n\t  AbstractMatrix.prototype.powM = function powM(matrix) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (this.rows !== matrix.rows ||\n\t      this.columns !== matrix.columns) {\n\t      throw new RangeError('Matrices dimensions must be equal');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) ** matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  };\n\t}\n\n\t/**\n\t * @private\n\t * Check that a row index is not out of bounds\n\t * @param {Matrix} matrix\n\t * @param {number} index\n\t * @param {boolean} [outer]\n\t */\n\tfunction checkRowIndex(matrix, index, outer) {\n\t  let max = outer ? matrix.rows : matrix.rows - 1;\n\t  if (index < 0 || index > max) {\n\t    throw new RangeError('Row index out of range');\n\t  }\n\t}\n\n\t/**\n\t * @private\n\t * Check that a column index is not out of bounds\n\t * @param {Matrix} matrix\n\t * @param {number} index\n\t * @param {boolean} [outer]\n\t */\n\tfunction checkColumnIndex(matrix, index, outer) {\n\t  let max = outer ? matrix.columns : matrix.columns - 1;\n\t  if (index < 0 || index > max) {\n\t    throw new RangeError('Column index out of range');\n\t  }\n\t}\n\n\t/**\n\t * @private\n\t * Check that the provided vector is an array with the right length\n\t * @param {Matrix} matrix\n\t * @param {Array|Matrix} vector\n\t * @return {Array}\n\t * @throws {RangeError}\n\t */\n\tfunction checkRowVector(matrix, vector) {\n\t  if (vector.to1DArray) {\n\t    vector = vector.to1DArray();\n\t  }\n\t  if (vector.length !== matrix.columns) {\n\t    throw new RangeError(\n\t      'vector size must be the same as the number of columns',\n\t    );\n\t  }\n\t  return vector;\n\t}\n\n\t/**\n\t * @private\n\t * Check that the provided vector is an array with the right length\n\t * @param {Matrix} matrix\n\t * @param {Array|Matrix} vector\n\t * @return {Array}\n\t * @throws {RangeError}\n\t */\n\tfunction checkColumnVector(matrix, vector) {\n\t  if (vector.to1DArray) {\n\t    vector = vector.to1DArray();\n\t  }\n\t  if (vector.length !== matrix.rows) {\n\t    throw new RangeError('vector size must be the same as the number of rows');\n\t  }\n\t  return vector;\n\t}\n\n\tfunction checkRowIndices(matrix, rowIndices) {\n\t  if (!isAnyArray.isAnyArray(rowIndices)) {\n\t    throw new TypeError('row indices must be an array');\n\t  }\n\n\t  for (let i = 0; i < rowIndices.length; i++) {\n\t    if (rowIndices[i] < 0 || rowIndices[i] >= matrix.rows) {\n\t      throw new RangeError('row indices are out of range');\n\t    }\n\t  }\n\t}\n\n\tfunction checkColumnIndices(matrix, columnIndices) {\n\t  if (!isAnyArray.isAnyArray(columnIndices)) {\n\t    throw new TypeError('column indices must be an array');\n\t  }\n\n\t  for (let i = 0; i < columnIndices.length; i++) {\n\t    if (columnIndices[i] < 0 || columnIndices[i] >= matrix.columns) {\n\t      throw new RangeError('column indices are out of range');\n\t    }\n\t  }\n\t}\n\n\tfunction checkRange(matrix, startRow, endRow, startColumn, endColumn) {\n\t  if (arguments.length !== 5) {\n\t    throw new RangeError('expected 4 arguments');\n\t  }\n\t  checkNumber('startRow', startRow);\n\t  checkNumber('endRow', endRow);\n\t  checkNumber('startColumn', startColumn);\n\t  checkNumber('endColumn', endColumn);\n\t  if (\n\t    startRow > endRow ||\n\t    startColumn > endColumn ||\n\t    startRow < 0 ||\n\t    startRow >= matrix.rows ||\n\t    endRow < 0 ||\n\t    endRow >= matrix.rows ||\n\t    startColumn < 0 ||\n\t    startColumn >= matrix.columns ||\n\t    endColumn < 0 ||\n\t    endColumn >= matrix.columns\n\t  ) {\n\t    throw new RangeError('Submatrix indices are out of range');\n\t  }\n\t}\n\n\tfunction newArray(length, value = 0) {\n\t  let array = [];\n\t  for (let i = 0; i < length; i++) {\n\t    array.push(value);\n\t  }\n\t  return array;\n\t}\n\n\tfunction checkNumber(name, value) {\n\t  if (typeof value !== 'number') {\n\t    throw new TypeError(`${name} must be a number`);\n\t  }\n\t}\n\n\tfunction checkNonEmpty(matrix) {\n\t  if (matrix.isEmpty()) {\n\t    throw new Error('Empty matrix has no elements to index');\n\t  }\n\t}\n\n\tfunction sumByRow(matrix) {\n\t  let sum = newArray(matrix.rows);\n\t  for (let i = 0; i < matrix.rows; ++i) {\n\t    for (let j = 0; j < matrix.columns; ++j) {\n\t      sum[i] += matrix.get(i, j);\n\t    }\n\t  }\n\t  return sum;\n\t}\n\n\tfunction sumByColumn(matrix) {\n\t  let sum = newArray(matrix.columns);\n\t  for (let i = 0; i < matrix.rows; ++i) {\n\t    for (let j = 0; j < matrix.columns; ++j) {\n\t      sum[j] += matrix.get(i, j);\n\t    }\n\t  }\n\t  return sum;\n\t}\n\n\tfunction sumAll(matrix) {\n\t  let v = 0;\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      v += matrix.get(i, j);\n\t    }\n\t  }\n\t  return v;\n\t}\n\n\tfunction productByRow(matrix) {\n\t  let sum = newArray(matrix.rows, 1);\n\t  for (let i = 0; i < matrix.rows; ++i) {\n\t    for (let j = 0; j < matrix.columns; ++j) {\n\t      sum[i] *= matrix.get(i, j);\n\t    }\n\t  }\n\t  return sum;\n\t}\n\n\tfunction productByColumn(matrix) {\n\t  let sum = newArray(matrix.columns, 1);\n\t  for (let i = 0; i < matrix.rows; ++i) {\n\t    for (let j = 0; j < matrix.columns; ++j) {\n\t      sum[j] *= matrix.get(i, j);\n\t    }\n\t  }\n\t  return sum;\n\t}\n\n\tfunction productAll(matrix) {\n\t  let v = 1;\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      v *= matrix.get(i, j);\n\t    }\n\t  }\n\t  return v;\n\t}\n\n\tfunction varianceByRow(matrix, unbiased, mean) {\n\t  const rows = matrix.rows;\n\t  const cols = matrix.columns;\n\t  const variance = [];\n\n\t  for (let i = 0; i < rows; i++) {\n\t    let sum1 = 0;\n\t    let sum2 = 0;\n\t    let x = 0;\n\t    for (let j = 0; j < cols; j++) {\n\t      x = matrix.get(i, j) - mean[i];\n\t      sum1 += x;\n\t      sum2 += x * x;\n\t    }\n\t    if (unbiased) {\n\t      variance.push((sum2 - (sum1 * sum1) / cols) / (cols - 1));\n\t    } else {\n\t      variance.push((sum2 - (sum1 * sum1) / cols) / cols);\n\t    }\n\t  }\n\t  return variance;\n\t}\n\n\tfunction varianceByColumn(matrix, unbiased, mean) {\n\t  const rows = matrix.rows;\n\t  const cols = matrix.columns;\n\t  const variance = [];\n\n\t  for (let j = 0; j < cols; j++) {\n\t    let sum1 = 0;\n\t    let sum2 = 0;\n\t    let x = 0;\n\t    for (let i = 0; i < rows; i++) {\n\t      x = matrix.get(i, j) - mean[j];\n\t      sum1 += x;\n\t      sum2 += x * x;\n\t    }\n\t    if (unbiased) {\n\t      variance.push((sum2 - (sum1 * sum1) / rows) / (rows - 1));\n\t    } else {\n\t      variance.push((sum2 - (sum1 * sum1) / rows) / rows);\n\t    }\n\t  }\n\t  return variance;\n\t}\n\n\tfunction varianceAll(matrix, unbiased, mean) {\n\t  const rows = matrix.rows;\n\t  const cols = matrix.columns;\n\t  const size = rows * cols;\n\n\t  let sum1 = 0;\n\t  let sum2 = 0;\n\t  let x = 0;\n\t  for (let i = 0; i < rows; i++) {\n\t    for (let j = 0; j < cols; j++) {\n\t      x = matrix.get(i, j) - mean;\n\t      sum1 += x;\n\t      sum2 += x * x;\n\t    }\n\t  }\n\t  if (unbiased) {\n\t    return (sum2 - (sum1 * sum1) / size) / (size - 1);\n\t  } else {\n\t    return (sum2 - (sum1 * sum1) / size) / size;\n\t  }\n\t}\n\n\tfunction centerByRow(matrix, mean) {\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      matrix.set(i, j, matrix.get(i, j) - mean[i]);\n\t    }\n\t  }\n\t}\n\n\tfunction centerByColumn(matrix, mean) {\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      matrix.set(i, j, matrix.get(i, j) - mean[j]);\n\t    }\n\t  }\n\t}\n\n\tfunction centerAll(matrix, mean) {\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      matrix.set(i, j, matrix.get(i, j) - mean);\n\t    }\n\t  }\n\t}\n\n\tfunction getScaleByRow(matrix) {\n\t  const scale = [];\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    let sum = 0;\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      sum += matrix.get(i, j) ** 2 / (matrix.columns - 1);\n\t    }\n\t    scale.push(Math.sqrt(sum));\n\t  }\n\t  return scale;\n\t}\n\n\tfunction scaleByRow(matrix, scale) {\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      matrix.set(i, j, matrix.get(i, j) / scale[i]);\n\t    }\n\t  }\n\t}\n\n\tfunction getScaleByColumn(matrix) {\n\t  const scale = [];\n\t  for (let j = 0; j < matrix.columns; j++) {\n\t    let sum = 0;\n\t    for (let i = 0; i < matrix.rows; i++) {\n\t      sum += matrix.get(i, j) ** 2 / (matrix.rows - 1);\n\t    }\n\t    scale.push(Math.sqrt(sum));\n\t  }\n\t  return scale;\n\t}\n\n\tfunction scaleByColumn(matrix, scale) {\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      matrix.set(i, j, matrix.get(i, j) / scale[j]);\n\t    }\n\t  }\n\t}\n\n\tfunction getScaleAll(matrix) {\n\t  const divider = matrix.size - 1;\n\t  let sum = 0;\n\t  for (let j = 0; j < matrix.columns; j++) {\n\t    for (let i = 0; i < matrix.rows; i++) {\n\t      sum += matrix.get(i, j) ** 2 / divider;\n\t    }\n\t  }\n\t  return Math.sqrt(sum);\n\t}\n\n\tfunction scaleAll(matrix, scale) {\n\t  for (let i = 0; i < matrix.rows; i++) {\n\t    for (let j = 0; j < matrix.columns; j++) {\n\t      matrix.set(i, j, matrix.get(i, j) / scale);\n\t    }\n\t  }\n\t}\n\n\tclass AbstractMatrix {\n\t  static from1DArray(newRows, newColumns, newData) {\n\t    let length = newRows * newColumns;\n\t    if (length !== newData.length) {\n\t      throw new RangeError('data length does not match given dimensions');\n\t    }\n\t    let newMatrix = new Matrix(newRows, newColumns);\n\t    for (let row = 0; row < newRows; row++) {\n\t      for (let column = 0; column < newColumns; column++) {\n\t        newMatrix.set(row, column, newData[row * newColumns + column]);\n\t      }\n\t    }\n\t    return newMatrix;\n\t  }\n\n\t  static rowVector(newData) {\n\t    let vector = new Matrix(1, newData.length);\n\t    for (let i = 0; i < newData.length; i++) {\n\t      vector.set(0, i, newData[i]);\n\t    }\n\t    return vector;\n\t  }\n\n\t  static columnVector(newData) {\n\t    let vector = new Matrix(newData.length, 1);\n\t    for (let i = 0; i < newData.length; i++) {\n\t      vector.set(i, 0, newData[i]);\n\t    }\n\t    return vector;\n\t  }\n\n\t  static zeros(rows, columns) {\n\t    return new Matrix(rows, columns);\n\t  }\n\n\t  static ones(rows, columns) {\n\t    return new Matrix(rows, columns).fill(1);\n\t  }\n\n\t  static rand(rows, columns, options = {}) {\n\t    if (typeof options !== 'object') {\n\t      throw new TypeError('options must be an object');\n\t    }\n\t    const { random = Math.random } = options;\n\t    let matrix = new Matrix(rows, columns);\n\t    for (let i = 0; i < rows; i++) {\n\t      for (let j = 0; j < columns; j++) {\n\t        matrix.set(i, j, random());\n\t      }\n\t    }\n\t    return matrix;\n\t  }\n\n\t  static randInt(rows, columns, options = {}) {\n\t    if (typeof options !== 'object') {\n\t      throw new TypeError('options must be an object');\n\t    }\n\t    const { min = 0, max = 1000, random = Math.random } = options;\n\t    if (!Number.isInteger(min)) throw new TypeError('min must be an integer');\n\t    if (!Number.isInteger(max)) throw new TypeError('max must be an integer');\n\t    if (min >= max) throw new RangeError('min must be smaller than max');\n\t    let interval = max - min;\n\t    let matrix = new Matrix(rows, columns);\n\t    for (let i = 0; i < rows; i++) {\n\t      for (let j = 0; j < columns; j++) {\n\t        let value = min + Math.round(random() * interval);\n\t        matrix.set(i, j, value);\n\t      }\n\t    }\n\t    return matrix;\n\t  }\n\n\t  static eye(rows, columns, value) {\n\t    if (columns === undefined) columns = rows;\n\t    if (value === undefined) value = 1;\n\t    let min = Math.min(rows, columns);\n\t    let matrix = this.zeros(rows, columns);\n\t    for (let i = 0; i < min; i++) {\n\t      matrix.set(i, i, value);\n\t    }\n\t    return matrix;\n\t  }\n\n\t  static diag(data, rows, columns) {\n\t    let l = data.length;\n\t    if (rows === undefined) rows = l;\n\t    if (columns === undefined) columns = rows;\n\t    let min = Math.min(l, rows, columns);\n\t    let matrix = this.zeros(rows, columns);\n\t    for (let i = 0; i < min; i++) {\n\t      matrix.set(i, i, data[i]);\n\t    }\n\t    return matrix;\n\t  }\n\n\t  static min(matrix1, matrix2) {\n\t    matrix1 = this.checkMatrix(matrix1);\n\t    matrix2 = this.checkMatrix(matrix2);\n\t    let rows = matrix1.rows;\n\t    let columns = matrix1.columns;\n\t    let result = new Matrix(rows, columns);\n\t    for (let i = 0; i < rows; i++) {\n\t      for (let j = 0; j < columns; j++) {\n\t        result.set(i, j, Math.min(matrix1.get(i, j), matrix2.get(i, j)));\n\t      }\n\t    }\n\t    return result;\n\t  }\n\n\t  static max(matrix1, matrix2) {\n\t    matrix1 = this.checkMatrix(matrix1);\n\t    matrix2 = this.checkMatrix(matrix2);\n\t    let rows = matrix1.rows;\n\t    let columns = matrix1.columns;\n\t    let result = new this(rows, columns);\n\t    for (let i = 0; i < rows; i++) {\n\t      for (let j = 0; j < columns; j++) {\n\t        result.set(i, j, Math.max(matrix1.get(i, j), matrix2.get(i, j)));\n\t      }\n\t    }\n\t    return result;\n\t  }\n\n\t  static checkMatrix(value) {\n\t    return AbstractMatrix.isMatrix(value) ? value : new Matrix(value);\n\t  }\n\n\t  static isMatrix(value) {\n\t    return value != null && value.klass === 'Matrix';\n\t  }\n\n\t  get size() {\n\t    return this.rows * this.columns;\n\t  }\n\n\t  apply(callback) {\n\t    if (typeof callback !== 'function') {\n\t      throw new TypeError('callback must be a function');\n\t    }\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        callback.call(this, i, j);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  to1DArray() {\n\t    let array = [];\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        array.push(this.get(i, j));\n\t      }\n\t    }\n\t    return array;\n\t  }\n\n\t  to2DArray() {\n\t    let copy = [];\n\t    for (let i = 0; i < this.rows; i++) {\n\t      copy.push([]);\n\t      for (let j = 0; j < this.columns; j++) {\n\t        copy[i].push(this.get(i, j));\n\t      }\n\t    }\n\t    return copy;\n\t  }\n\n\t  toJSON() {\n\t    return this.to2DArray();\n\t  }\n\n\t  isRowVector() {\n\t    return this.rows === 1;\n\t  }\n\n\t  isColumnVector() {\n\t    return this.columns === 1;\n\t  }\n\n\t  isVector() {\n\t    return this.rows === 1 || this.columns === 1;\n\t  }\n\n\t  isSquare() {\n\t    return this.rows === this.columns;\n\t  }\n\n\t  isEmpty() {\n\t    return this.rows === 0 || this.columns === 0;\n\t  }\n\n\t  isSymmetric() {\n\t    if (this.isSquare()) {\n\t      for (let i = 0; i < this.rows; i++) {\n\t        for (let j = 0; j <= i; j++) {\n\t          if (this.get(i, j) !== this.get(j, i)) {\n\t            return false;\n\t          }\n\t        }\n\t      }\n\t      return true;\n\t    }\n\t    return false;\n\t  }\n\n\t  isDistance() {\n\t    if (!this.isSymmetric()) return false;\n\n\t    for (let i = 0; i < this.rows; i++) {\n\t      if (this.get(i, i) !== 0) return false;\n\t    }\n\n\t    return true;\n\t  }\n\n\t  isEchelonForm() {\n\t    let i = 0;\n\t    let j = 0;\n\t    let previousColumn = -1;\n\t    let isEchelonForm = true;\n\t    let checked = false;\n\t    while (i < this.rows && isEchelonForm) {\n\t      j = 0;\n\t      checked = false;\n\t      while (j < this.columns && checked === false) {\n\t        if (this.get(i, j) === 0) {\n\t          j++;\n\t        } else if (this.get(i, j) === 1 && j > previousColumn) {\n\t          checked = true;\n\t          previousColumn = j;\n\t        } else {\n\t          isEchelonForm = false;\n\t          checked = true;\n\t        }\n\t      }\n\t      i++;\n\t    }\n\t    return isEchelonForm;\n\t  }\n\n\t  isReducedEchelonForm() {\n\t    let i = 0;\n\t    let j = 0;\n\t    let previousColumn = -1;\n\t    let isReducedEchelonForm = true;\n\t    let checked = false;\n\t    while (i < this.rows && isReducedEchelonForm) {\n\t      j = 0;\n\t      checked = false;\n\t      while (j < this.columns && checked === false) {\n\t        if (this.get(i, j) === 0) {\n\t          j++;\n\t        } else if (this.get(i, j) === 1 && j > previousColumn) {\n\t          checked = true;\n\t          previousColumn = j;\n\t        } else {\n\t          isReducedEchelonForm = false;\n\t          checked = true;\n\t        }\n\t      }\n\t      for (let k = j + 1; k < this.rows; k++) {\n\t        if (this.get(i, k) !== 0) {\n\t          isReducedEchelonForm = false;\n\t        }\n\t      }\n\t      i++;\n\t    }\n\t    return isReducedEchelonForm;\n\t  }\n\n\t  echelonForm() {\n\t    let result = this.clone();\n\t    let h = 0;\n\t    let k = 0;\n\t    while (h < result.rows && k < result.columns) {\n\t      let iMax = h;\n\t      for (let i = h; i < result.rows; i++) {\n\t        if (result.get(i, k) > result.get(iMax, k)) {\n\t          iMax = i;\n\t        }\n\t      }\n\t      if (result.get(iMax, k) === 0) {\n\t        k++;\n\t      } else {\n\t        result.swapRows(h, iMax);\n\t        let tmp = result.get(h, k);\n\t        for (let j = k; j < result.columns; j++) {\n\t          result.set(h, j, result.get(h, j) / tmp);\n\t        }\n\t        for (let i = h + 1; i < result.rows; i++) {\n\t          let factor = result.get(i, k) / result.get(h, k);\n\t          result.set(i, k, 0);\n\t          for (let j = k + 1; j < result.columns; j++) {\n\t            result.set(i, j, result.get(i, j) - result.get(h, j) * factor);\n\t          }\n\t        }\n\t        h++;\n\t        k++;\n\t      }\n\t    }\n\t    return result;\n\t  }\n\n\t  reducedEchelonForm() {\n\t    let result = this.echelonForm();\n\t    let m = result.columns;\n\t    let n = result.rows;\n\t    let h = n - 1;\n\t    while (h >= 0) {\n\t      if (result.maxRow(h) === 0) {\n\t        h--;\n\t      } else {\n\t        let p = 0;\n\t        let pivot = false;\n\t        while (p < n && pivot === false) {\n\t          if (result.get(h, p) === 1) {\n\t            pivot = true;\n\t          } else {\n\t            p++;\n\t          }\n\t        }\n\t        for (let i = 0; i < h; i++) {\n\t          let factor = result.get(i, p);\n\t          for (let j = p; j < m; j++) {\n\t            let tmp = result.get(i, j) - factor * result.get(h, j);\n\t            result.set(i, j, tmp);\n\t          }\n\t        }\n\t        h--;\n\t      }\n\t    }\n\t    return result;\n\t  }\n\n\t  set() {\n\t    throw new Error('set method is unimplemented');\n\t  }\n\n\t  get() {\n\t    throw new Error('get method is unimplemented');\n\t  }\n\n\t  repeat(options = {}) {\n\t    if (typeof options !== 'object') {\n\t      throw new TypeError('options must be an object');\n\t    }\n\t    const { rows = 1, columns = 1 } = options;\n\t    if (!Number.isInteger(rows) || rows <= 0) {\n\t      throw new TypeError('rows must be a positive integer');\n\t    }\n\t    if (!Number.isInteger(columns) || columns <= 0) {\n\t      throw new TypeError('columns must be a positive integer');\n\t    }\n\t    let matrix = new Matrix(this.rows * rows, this.columns * columns);\n\t    for (let i = 0; i < rows; i++) {\n\t      for (let j = 0; j < columns; j++) {\n\t        matrix.setSubMatrix(this, this.rows * i, this.columns * j);\n\t      }\n\t    }\n\t    return matrix;\n\t  }\n\n\t  fill(value) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, value);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  neg() {\n\t    return this.mulS(-1);\n\t  }\n\n\t  getRow(index) {\n\t    checkRowIndex(this, index);\n\t    let row = [];\n\t    for (let i = 0; i < this.columns; i++) {\n\t      row.push(this.get(index, i));\n\t    }\n\t    return row;\n\t  }\n\n\t  getRowVector(index) {\n\t    return Matrix.rowVector(this.getRow(index));\n\t  }\n\n\t  setRow(index, array) {\n\t    checkRowIndex(this, index);\n\t    array = checkRowVector(this, array);\n\t    for (let i = 0; i < this.columns; i++) {\n\t      this.set(index, i, array[i]);\n\t    }\n\t    return this;\n\t  }\n\n\t  swapRows(row1, row2) {\n\t    checkRowIndex(this, row1);\n\t    checkRowIndex(this, row2);\n\t    for (let i = 0; i < this.columns; i++) {\n\t      let temp = this.get(row1, i);\n\t      this.set(row1, i, this.get(row2, i));\n\t      this.set(row2, i, temp);\n\t    }\n\t    return this;\n\t  }\n\n\t  getColumn(index) {\n\t    checkColumnIndex(this, index);\n\t    let column = [];\n\t    for (let i = 0; i < this.rows; i++) {\n\t      column.push(this.get(i, index));\n\t    }\n\t    return column;\n\t  }\n\n\t  getColumnVector(index) {\n\t    return Matrix.columnVector(this.getColumn(index));\n\t  }\n\n\t  setColumn(index, array) {\n\t    checkColumnIndex(this, index);\n\t    array = checkColumnVector(this, array);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      this.set(i, index, array[i]);\n\t    }\n\t    return this;\n\t  }\n\n\t  swapColumns(column1, column2) {\n\t    checkColumnIndex(this, column1);\n\t    checkColumnIndex(this, column2);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      let temp = this.get(i, column1);\n\t      this.set(i, column1, this.get(i, column2));\n\t      this.set(i, column2, temp);\n\t    }\n\t    return this;\n\t  }\n\n\t  addRowVector(vector) {\n\t    vector = checkRowVector(this, vector);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) + vector[j]);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  subRowVector(vector) {\n\t    vector = checkRowVector(this, vector);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) - vector[j]);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  mulRowVector(vector) {\n\t    vector = checkRowVector(this, vector);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) * vector[j]);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  divRowVector(vector) {\n\t    vector = checkRowVector(this, vector);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) / vector[j]);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  addColumnVector(vector) {\n\t    vector = checkColumnVector(this, vector);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) + vector[i]);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  subColumnVector(vector) {\n\t    vector = checkColumnVector(this, vector);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) - vector[i]);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  mulColumnVector(vector) {\n\t    vector = checkColumnVector(this, vector);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) * vector[i]);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  divColumnVector(vector) {\n\t    vector = checkColumnVector(this, vector);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        this.set(i, j, this.get(i, j) / vector[i]);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  mulRow(index, value) {\n\t    checkRowIndex(this, index);\n\t    for (let i = 0; i < this.columns; i++) {\n\t      this.set(index, i, this.get(index, i) * value);\n\t    }\n\t    return this;\n\t  }\n\n\t  mulColumn(index, value) {\n\t    checkColumnIndex(this, index);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      this.set(i, index, this.get(i, index) * value);\n\t    }\n\t    return this;\n\t  }\n\n\t  max(by) {\n\t    if (this.isEmpty()) {\n\t      return NaN;\n\t    }\n\t    switch (by) {\n\t      case 'row': {\n\t        const max = new Array(this.rows).fill(Number.NEGATIVE_INFINITY);\n\t        for (let row = 0; row < this.rows; row++) {\n\t          for (let column = 0; column < this.columns; column++) {\n\t            if (this.get(row, column) > max[row]) {\n\t              max[row] = this.get(row, column);\n\t            }\n\t          }\n\t        }\n\t        return max;\n\t      }\n\t      case 'column': {\n\t        const max = new Array(this.columns).fill(Number.NEGATIVE_INFINITY);\n\t        for (let row = 0; row < this.rows; row++) {\n\t          for (let column = 0; column < this.columns; column++) {\n\t            if (this.get(row, column) > max[column]) {\n\t              max[column] = this.get(row, column);\n\t            }\n\t          }\n\t        }\n\t        return max;\n\t      }\n\t      case undefined: {\n\t        let max = this.get(0, 0);\n\t        for (let row = 0; row < this.rows; row++) {\n\t          for (let column = 0; column < this.columns; column++) {\n\t            if (this.get(row, column) > max) {\n\t              max = this.get(row, column);\n\t            }\n\t          }\n\t        }\n\t        return max;\n\t      }\n\t      default:\n\t        throw new Error(`invalid option: ${by}`);\n\t    }\n\t  }\n\n\t  maxIndex() {\n\t    checkNonEmpty(this);\n\t    let v = this.get(0, 0);\n\t    let idx = [0, 0];\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        if (this.get(i, j) > v) {\n\t          v = this.get(i, j);\n\t          idx[0] = i;\n\t          idx[1] = j;\n\t        }\n\t      }\n\t    }\n\t    return idx;\n\t  }\n\n\t  min(by) {\n\t    if (this.isEmpty()) {\n\t      return NaN;\n\t    }\n\n\t    switch (by) {\n\t      case 'row': {\n\t        const min = new Array(this.rows).fill(Number.POSITIVE_INFINITY);\n\t        for (let row = 0; row < this.rows; row++) {\n\t          for (let column = 0; column < this.columns; column++) {\n\t            if (this.get(row, column) < min[row]) {\n\t              min[row] = this.get(row, column);\n\t            }\n\t          }\n\t        }\n\t        return min;\n\t      }\n\t      case 'column': {\n\t        const min = new Array(this.columns).fill(Number.POSITIVE_INFINITY);\n\t        for (let row = 0; row < this.rows; row++) {\n\t          for (let column = 0; column < this.columns; column++) {\n\t            if (this.get(row, column) < min[column]) {\n\t              min[column] = this.get(row, column);\n\t            }\n\t          }\n\t        }\n\t        return min;\n\t      }\n\t      case undefined: {\n\t        let min = this.get(0, 0);\n\t        for (let row = 0; row < this.rows; row++) {\n\t          for (let column = 0; column < this.columns; column++) {\n\t            if (this.get(row, column) < min) {\n\t              min = this.get(row, column);\n\t            }\n\t          }\n\t        }\n\t        return min;\n\t      }\n\t      default:\n\t        throw new Error(`invalid option: ${by}`);\n\t    }\n\t  }\n\n\t  minIndex() {\n\t    checkNonEmpty(this);\n\t    let v = this.get(0, 0);\n\t    let idx = [0, 0];\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        if (this.get(i, j) < v) {\n\t          v = this.get(i, j);\n\t          idx[0] = i;\n\t          idx[1] = j;\n\t        }\n\t      }\n\t    }\n\t    return idx;\n\t  }\n\n\t  maxRow(row) {\n\t    checkRowIndex(this, row);\n\t    if (this.isEmpty()) {\n\t      return NaN;\n\t    }\n\t    let v = this.get(row, 0);\n\t    for (let i = 1; i < this.columns; i++) {\n\t      if (this.get(row, i) > v) {\n\t        v = this.get(row, i);\n\t      }\n\t    }\n\t    return v;\n\t  }\n\n\t  maxRowIndex(row) {\n\t    checkRowIndex(this, row);\n\t    checkNonEmpty(this);\n\t    let v = this.get(row, 0);\n\t    let idx = [row, 0];\n\t    for (let i = 1; i < this.columns; i++) {\n\t      if (this.get(row, i) > v) {\n\t        v = this.get(row, i);\n\t        idx[1] = i;\n\t      }\n\t    }\n\t    return idx;\n\t  }\n\n\t  minRow(row) {\n\t    checkRowIndex(this, row);\n\t    if (this.isEmpty()) {\n\t      return NaN;\n\t    }\n\t    let v = this.get(row, 0);\n\t    for (let i = 1; i < this.columns; i++) {\n\t      if (this.get(row, i) < v) {\n\t        v = this.get(row, i);\n\t      }\n\t    }\n\t    return v;\n\t  }\n\n\t  minRowIndex(row) {\n\t    checkRowIndex(this, row);\n\t    checkNonEmpty(this);\n\t    let v = this.get(row, 0);\n\t    let idx = [row, 0];\n\t    for (let i = 1; i < this.columns; i++) {\n\t      if (this.get(row, i) < v) {\n\t        v = this.get(row, i);\n\t        idx[1] = i;\n\t      }\n\t    }\n\t    return idx;\n\t  }\n\n\t  maxColumn(column) {\n\t    checkColumnIndex(this, column);\n\t    if (this.isEmpty()) {\n\t      return NaN;\n\t    }\n\t    let v = this.get(0, column);\n\t    for (let i = 1; i < this.rows; i++) {\n\t      if (this.get(i, column) > v) {\n\t        v = this.get(i, column);\n\t      }\n\t    }\n\t    return v;\n\t  }\n\n\t  maxColumnIndex(column) {\n\t    checkColumnIndex(this, column);\n\t    checkNonEmpty(this);\n\t    let v = this.get(0, column);\n\t    let idx = [0, column];\n\t    for (let i = 1; i < this.rows; i++) {\n\t      if (this.get(i, column) > v) {\n\t        v = this.get(i, column);\n\t        idx[0] = i;\n\t      }\n\t    }\n\t    return idx;\n\t  }\n\n\t  minColumn(column) {\n\t    checkColumnIndex(this, column);\n\t    if (this.isEmpty()) {\n\t      return NaN;\n\t    }\n\t    let v = this.get(0, column);\n\t    for (let i = 1; i < this.rows; i++) {\n\t      if (this.get(i, column) < v) {\n\t        v = this.get(i, column);\n\t      }\n\t    }\n\t    return v;\n\t  }\n\n\t  minColumnIndex(column) {\n\t    checkColumnIndex(this, column);\n\t    checkNonEmpty(this);\n\t    let v = this.get(0, column);\n\t    let idx = [0, column];\n\t    for (let i = 1; i < this.rows; i++) {\n\t      if (this.get(i, column) < v) {\n\t        v = this.get(i, column);\n\t        idx[0] = i;\n\t      }\n\t    }\n\t    return idx;\n\t  }\n\n\t  diag() {\n\t    let min = Math.min(this.rows, this.columns);\n\t    let diag = [];\n\t    for (let i = 0; i < min; i++) {\n\t      diag.push(this.get(i, i));\n\t    }\n\t    return diag;\n\t  }\n\n\t  norm(type = 'frobenius') {\n\t    switch (type) {\n\t      case 'max':\n\t        return this.max();\n\t      case 'frobenius':\n\t        return Math.sqrt(this.dot(this));\n\t      default:\n\t        throw new RangeError(`unknown norm type: ${type}`);\n\t    }\n\t  }\n\n\t  cumulativeSum() {\n\t    let sum = 0;\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        sum += this.get(i, j);\n\t        this.set(i, j, sum);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  dot(vector2) {\n\t    if (AbstractMatrix.isMatrix(vector2)) vector2 = vector2.to1DArray();\n\t    let vector1 = this.to1DArray();\n\t    if (vector1.length !== vector2.length) {\n\t      throw new RangeError('vectors do not have the same size');\n\t    }\n\t    let dot = 0;\n\t    for (let i = 0; i < vector1.length; i++) {\n\t      dot += vector1[i] * vector2[i];\n\t    }\n\t    return dot;\n\t  }\n\n\t  mmul(other) {\n\t    other = Matrix.checkMatrix(other);\n\n\t    let m = this.rows;\n\t    let n = this.columns;\n\t    let p = other.columns;\n\n\t    let result = new Matrix(m, p);\n\n\t    let Bcolj = new Float64Array(n);\n\t    for (let j = 0; j < p; j++) {\n\t      for (let k = 0; k < n; k++) {\n\t        Bcolj[k] = other.get(k, j);\n\t      }\n\n\t      for (let i = 0; i < m; i++) {\n\t        let s = 0;\n\t        for (let k = 0; k < n; k++) {\n\t          s += this.get(i, k) * Bcolj[k];\n\t        }\n\n\t        result.set(i, j, s);\n\t      }\n\t    }\n\t    return result;\n\t  }\n\n\t  mpow(scalar) {\n\t    if (!this.isSquare()) {\n\t      throw new RangeError('Matrix must be square');\n\t    }\n\t    if (!Number.isInteger(scalar) || scalar < 0) {\n\t      throw new RangeError('Exponent must be a non-negative integer');\n\t    }\n\t    // Russian Peasant exponentiation, i.e. exponentiation by squaring\n\t    let result = Matrix.eye(this.rows);\n\t    let bb = this;\n\t    // Note: Don't bit shift. In JS, that would truncate at 32 bits\n\t    for (let e = scalar; e >= 1; e /= 2) {\n\t      if ((e & 1) !== 0) {\n\t        result = result.mmul(bb);\n\t      }\n\t      bb = bb.mmul(bb);\n\t    }\n\t    return result;\n\t  }\n\n\t  strassen2x2(other) {\n\t    other = Matrix.checkMatrix(other);\n\t    let result = new Matrix(2, 2);\n\t    const a11 = this.get(0, 0);\n\t    const b11 = other.get(0, 0);\n\t    const a12 = this.get(0, 1);\n\t    const b12 = other.get(0, 1);\n\t    const a21 = this.get(1, 0);\n\t    const b21 = other.get(1, 0);\n\t    const a22 = this.get(1, 1);\n\t    const b22 = other.get(1, 1);\n\n\t    // Compute intermediate values.\n\t    const m1 = (a11 + a22) * (b11 + b22);\n\t    const m2 = (a21 + a22) * b11;\n\t    const m3 = a11 * (b12 - b22);\n\t    const m4 = a22 * (b21 - b11);\n\t    const m5 = (a11 + a12) * b22;\n\t    const m6 = (a21 - a11) * (b11 + b12);\n\t    const m7 = (a12 - a22) * (b21 + b22);\n\n\t    // Combine intermediate values into the output.\n\t    const c00 = m1 + m4 - m5 + m7;\n\t    const c01 = m3 + m5;\n\t    const c10 = m2 + m4;\n\t    const c11 = m1 - m2 + m3 + m6;\n\n\t    result.set(0, 0, c00);\n\t    result.set(0, 1, c01);\n\t    result.set(1, 0, c10);\n\t    result.set(1, 1, c11);\n\t    return result;\n\t  }\n\n\t  strassen3x3(other) {\n\t    other = Matrix.checkMatrix(other);\n\t    let result = new Matrix(3, 3);\n\n\t    const a00 = this.get(0, 0);\n\t    const a01 = this.get(0, 1);\n\t    const a02 = this.get(0, 2);\n\t    const a10 = this.get(1, 0);\n\t    const a11 = this.get(1, 1);\n\t    const a12 = this.get(1, 2);\n\t    const a20 = this.get(2, 0);\n\t    const a21 = this.get(2, 1);\n\t    const a22 = this.get(2, 2);\n\n\t    const b00 = other.get(0, 0);\n\t    const b01 = other.get(0, 1);\n\t    const b02 = other.get(0, 2);\n\t    const b10 = other.get(1, 0);\n\t    const b11 = other.get(1, 1);\n\t    const b12 = other.get(1, 2);\n\t    const b20 = other.get(2, 0);\n\t    const b21 = other.get(2, 1);\n\t    const b22 = other.get(2, 2);\n\n\t    const m1 = (a00 + a01 + a02 - a10 - a11 - a21 - a22) * b11;\n\t    const m2 = (a00 - a10) * (-b01 + b11);\n\t    const m3 = a11 * (-b00 + b01 + b10 - b11 - b12 - b20 + b22);\n\t    const m4 = (-a00 + a10 + a11) * (b00 - b01 + b11);\n\t    const m5 = (a10 + a11) * (-b00 + b01);\n\t    const m6 = a00 * b00;\n\t    const m7 = (-a00 + a20 + a21) * (b00 - b02 + b12);\n\t    const m8 = (-a00 + a20) * (b02 - b12);\n\t    const m9 = (a20 + a21) * (-b00 + b02);\n\t    const m10 = (a00 + a01 + a02 - a11 - a12 - a20 - a21) * b12;\n\t    const m11 = a21 * (-b00 + b02 + b10 - b11 - b12 - b20 + b21);\n\t    const m12 = (-a02 + a21 + a22) * (b11 + b20 - b21);\n\t    const m13 = (a02 - a22) * (b11 - b21);\n\t    const m14 = a02 * b20;\n\t    const m15 = (a21 + a22) * (-b20 + b21);\n\t    const m16 = (-a02 + a11 + a12) * (b12 + b20 - b22);\n\t    const m17 = (a02 - a12) * (b12 - b22);\n\t    const m18 = (a11 + a12) * (-b20 + b22);\n\t    const m19 = a01 * b10;\n\t    const m20 = a12 * b21;\n\t    const m21 = a10 * b02;\n\t    const m22 = a20 * b01;\n\t    const m23 = a22 * b22;\n\n\t    const c00 = m6 + m14 + m19;\n\t    const c01 = m1 + m4 + m5 + m6 + m12 + m14 + m15;\n\t    const c02 = m6 + m7 + m9 + m10 + m14 + m16 + m18;\n\t    const c10 = m2 + m3 + m4 + m6 + m14 + m16 + m17;\n\t    const c11 = m2 + m4 + m5 + m6 + m20;\n\t    const c12 = m14 + m16 + m17 + m18 + m21;\n\t    const c20 = m6 + m7 + m8 + m11 + m12 + m13 + m14;\n\t    const c21 = m12 + m13 + m14 + m15 + m22;\n\t    const c22 = m6 + m7 + m8 + m9 + m23;\n\n\t    result.set(0, 0, c00);\n\t    result.set(0, 1, c01);\n\t    result.set(0, 2, c02);\n\t    result.set(1, 0, c10);\n\t    result.set(1, 1, c11);\n\t    result.set(1, 2, c12);\n\t    result.set(2, 0, c20);\n\t    result.set(2, 1, c21);\n\t    result.set(2, 2, c22);\n\t    return result;\n\t  }\n\n\t  mmulStrassen(y) {\n\t    y = Matrix.checkMatrix(y);\n\t    let x = this.clone();\n\t    let r1 = x.rows;\n\t    let c1 = x.columns;\n\t    let r2 = y.rows;\n\t    let c2 = y.columns;\n\t    if (c1 !== r2) {\n\t      // eslint-disable-next-line no-console\n\t      console.warn(\n\t        `Multiplying ${r1} x ${c1} and ${r2} x ${c2} matrix: dimensions do not match.`,\n\t      );\n\t    }\n\n\t    // Put a matrix into the top left of a matrix of zeros.\n\t    // `rows` and `cols` are the dimensions of the output matrix.\n\t    function embed(mat, rows, cols) {\n\t      let r = mat.rows;\n\t      let c = mat.columns;\n\t      if (r === rows && c === cols) {\n\t        return mat;\n\t      } else {\n\t        let resultat = AbstractMatrix.zeros(rows, cols);\n\t        resultat = resultat.setSubMatrix(mat, 0, 0);\n\t        return resultat;\n\t      }\n\t    }\n\n\t    // Make sure both matrices are the same size.\n\t    // This is exclusively for simplicity:\n\t    // this algorithm can be implemented with matrices of different sizes.\n\n\t    let r = Math.max(r1, r2);\n\t    let c = Math.max(c1, c2);\n\t    x = embed(x, r, c);\n\t    y = embed(y, r, c);\n\n\t    // Our recursive multiplication function.\n\t    function blockMult(a, b, rows, cols) {\n\t      // For small matrices, resort to naive multiplication.\n\t      if (rows <= 512 || cols <= 512) {\n\t        return a.mmul(b); // a is equivalent to this\n\t      }\n\n\t      // Apply dynamic padding.\n\t      if (rows % 2 === 1 && cols % 2 === 1) {\n\t        a = embed(a, rows + 1, cols + 1);\n\t        b = embed(b, rows + 1, cols + 1);\n\t      } else if (rows % 2 === 1) {\n\t        a = embed(a, rows + 1, cols);\n\t        b = embed(b, rows + 1, cols);\n\t      } else if (cols % 2 === 1) {\n\t        a = embed(a, rows, cols + 1);\n\t        b = embed(b, rows, cols + 1);\n\t      }\n\n\t      let halfRows = parseInt(a.rows / 2, 10);\n\t      let halfCols = parseInt(a.columns / 2, 10);\n\t      // Subdivide input matrices.\n\t      let a11 = a.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n\t      let b11 = b.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n\n\t      let a12 = a.subMatrix(0, halfRows - 1, halfCols, a.columns - 1);\n\t      let b12 = b.subMatrix(0, halfRows - 1, halfCols, b.columns - 1);\n\n\t      let a21 = a.subMatrix(halfRows, a.rows - 1, 0, halfCols - 1);\n\t      let b21 = b.subMatrix(halfRows, b.rows - 1, 0, halfCols - 1);\n\n\t      let a22 = a.subMatrix(halfRows, a.rows - 1, halfCols, a.columns - 1);\n\t      let b22 = b.subMatrix(halfRows, b.rows - 1, halfCols, b.columns - 1);\n\n\t      // Compute intermediate values.\n\t      let m1 = blockMult(\n\t        AbstractMatrix.add(a11, a22),\n\t        AbstractMatrix.add(b11, b22),\n\t        halfRows,\n\t        halfCols,\n\t      );\n\t      let m2 = blockMult(AbstractMatrix.add(a21, a22), b11, halfRows, halfCols);\n\t      let m3 = blockMult(a11, AbstractMatrix.sub(b12, b22), halfRows, halfCols);\n\t      let m4 = blockMult(a22, AbstractMatrix.sub(b21, b11), halfRows, halfCols);\n\t      let m5 = blockMult(AbstractMatrix.add(a11, a12), b22, halfRows, halfCols);\n\t      let m6 = blockMult(\n\t        AbstractMatrix.sub(a21, a11),\n\t        AbstractMatrix.add(b11, b12),\n\t        halfRows,\n\t        halfCols,\n\t      );\n\t      let m7 = blockMult(\n\t        AbstractMatrix.sub(a12, a22),\n\t        AbstractMatrix.add(b21, b22),\n\t        halfRows,\n\t        halfCols,\n\t      );\n\n\t      // Combine intermediate values into the output.\n\t      let c11 = AbstractMatrix.add(m1, m4);\n\t      c11.sub(m5);\n\t      c11.add(m7);\n\t      let c12 = AbstractMatrix.add(m3, m5);\n\t      let c21 = AbstractMatrix.add(m2, m4);\n\t      let c22 = AbstractMatrix.sub(m1, m2);\n\t      c22.add(m3);\n\t      c22.add(m6);\n\n\t      // Crop output to the desired size (undo dynamic padding).\n\t      let result = AbstractMatrix.zeros(2 * c11.rows, 2 * c11.columns);\n\t      result = result.setSubMatrix(c11, 0, 0);\n\t      result = result.setSubMatrix(c12, c11.rows, 0);\n\t      result = result.setSubMatrix(c21, 0, c11.columns);\n\t      result = result.setSubMatrix(c22, c11.rows, c11.columns);\n\t      return result.subMatrix(0, rows - 1, 0, cols - 1);\n\t    }\n\n\t    return blockMult(x, y, r, c);\n\t  }\n\n\t  scaleRows(options = {}) {\n\t    if (typeof options !== 'object') {\n\t      throw new TypeError('options must be an object');\n\t    }\n\t    const { min = 0, max = 1 } = options;\n\t    if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n\t    if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n\t    if (min >= max) throw new RangeError('min must be smaller than max');\n\t    let newMatrix = new Matrix(this.rows, this.columns);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      const row = this.getRow(i);\n\t      if (row.length > 0) {\n\t        rescale(row, { min, max, output: row });\n\t      }\n\t      newMatrix.setRow(i, row);\n\t    }\n\t    return newMatrix;\n\t  }\n\n\t  scaleColumns(options = {}) {\n\t    if (typeof options !== 'object') {\n\t      throw new TypeError('options must be an object');\n\t    }\n\t    const { min = 0, max = 1 } = options;\n\t    if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n\t    if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n\t    if (min >= max) throw new RangeError('min must be smaller than max');\n\t    let newMatrix = new Matrix(this.rows, this.columns);\n\t    for (let i = 0; i < this.columns; i++) {\n\t      const column = this.getColumn(i);\n\t      if (column.length) {\n\t        rescale(column, {\n\t          min,\n\t          max,\n\t          output: column,\n\t        });\n\t      }\n\t      newMatrix.setColumn(i, column);\n\t    }\n\t    return newMatrix;\n\t  }\n\n\t  flipRows() {\n\t    const middle = Math.ceil(this.columns / 2);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < middle; j++) {\n\t        let first = this.get(i, j);\n\t        let last = this.get(i, this.columns - 1 - j);\n\t        this.set(i, j, last);\n\t        this.set(i, this.columns - 1 - j, first);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  flipColumns() {\n\t    const middle = Math.ceil(this.rows / 2);\n\t    for (let j = 0; j < this.columns; j++) {\n\t      for (let i = 0; i < middle; i++) {\n\t        let first = this.get(i, j);\n\t        let last = this.get(this.rows - 1 - i, j);\n\t        this.set(i, j, last);\n\t        this.set(this.rows - 1 - i, j, first);\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  kroneckerProduct(other) {\n\t    other = Matrix.checkMatrix(other);\n\n\t    let m = this.rows;\n\t    let n = this.columns;\n\t    let p = other.rows;\n\t    let q = other.columns;\n\n\t    let result = new Matrix(m * p, n * q);\n\t    for (let i = 0; i < m; i++) {\n\t      for (let j = 0; j < n; j++) {\n\t        for (let k = 0; k < p; k++) {\n\t          for (let l = 0; l < q; l++) {\n\t            result.set(p * i + k, q * j + l, this.get(i, j) * other.get(k, l));\n\t          }\n\t        }\n\t      }\n\t    }\n\t    return result;\n\t  }\n\n\t  kroneckerSum(other) {\n\t    other = Matrix.checkMatrix(other);\n\t    if (!this.isSquare() || !other.isSquare()) {\n\t      throw new Error('Kronecker Sum needs two Square Matrices');\n\t    }\n\t    let m = this.rows;\n\t    let n = other.rows;\n\t    let AxI = this.kroneckerProduct(Matrix.eye(n, n));\n\t    let IxB = Matrix.eye(m, m).kroneckerProduct(other);\n\t    return AxI.add(IxB);\n\t  }\n\n\t  transpose() {\n\t    let result = new Matrix(this.columns, this.rows);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      for (let j = 0; j < this.columns; j++) {\n\t        result.set(j, i, this.get(i, j));\n\t      }\n\t    }\n\t    return result;\n\t  }\n\n\t  sortRows(compareFunction = compareNumbers) {\n\t    for (let i = 0; i < this.rows; i++) {\n\t      this.setRow(i, this.getRow(i).sort(compareFunction));\n\t    }\n\t    return this;\n\t  }\n\n\t  sortColumns(compareFunction = compareNumbers) {\n\t    for (let i = 0; i < this.columns; i++) {\n\t      this.setColumn(i, this.getColumn(i).sort(compareFunction));\n\t    }\n\t    return this;\n\t  }\n\n\t  subMatrix(startRow, endRow, startColumn, endColumn) {\n\t    checkRange(this, startRow, endRow, startColumn, endColumn);\n\t    let newMatrix = new Matrix(\n\t      endRow - startRow + 1,\n\t      endColumn - startColumn + 1,\n\t    );\n\t    for (let i = startRow; i <= endRow; i++) {\n\t      for (let j = startColumn; j <= endColumn; j++) {\n\t        newMatrix.set(i - startRow, j - startColumn, this.get(i, j));\n\t      }\n\t    }\n\t    return newMatrix;\n\t  }\n\n\t  subMatrixRow(indices, startColumn, endColumn) {\n\t    if (startColumn === undefined) startColumn = 0;\n\t    if (endColumn === undefined) endColumn = this.columns - 1;\n\t    if (\n\t      startColumn > endColumn ||\n\t      startColumn < 0 ||\n\t      startColumn >= this.columns ||\n\t      endColumn < 0 ||\n\t      endColumn >= this.columns\n\t    ) {\n\t      throw new RangeError('Argument out of range');\n\t    }\n\n\t    let newMatrix = new Matrix(indices.length, endColumn - startColumn + 1);\n\t    for (let i = 0; i < indices.length; i++) {\n\t      for (let j = startColumn; j <= endColumn; j++) {\n\t        if (indices[i] < 0 || indices[i] >= this.rows) {\n\t          throw new RangeError(`Row index out of range: ${indices[i]}`);\n\t        }\n\t        newMatrix.set(i, j - startColumn, this.get(indices[i], j));\n\t      }\n\t    }\n\t    return newMatrix;\n\t  }\n\n\t  subMatrixColumn(indices, startRow, endRow) {\n\t    if (startRow === undefined) startRow = 0;\n\t    if (endRow === undefined) endRow = this.rows - 1;\n\t    if (\n\t      startRow > endRow ||\n\t      startRow < 0 ||\n\t      startRow >= this.rows ||\n\t      endRow < 0 ||\n\t      endRow >= this.rows\n\t    ) {\n\t      throw new RangeError('Argument out of range');\n\t    }\n\n\t    let newMatrix = new Matrix(endRow - startRow + 1, indices.length);\n\t    for (let i = 0; i < indices.length; i++) {\n\t      for (let j = startRow; j <= endRow; j++) {\n\t        if (indices[i] < 0 || indices[i] >= this.columns) {\n\t          throw new RangeError(`Column index out of range: ${indices[i]}`);\n\t        }\n\t        newMatrix.set(j - startRow, i, this.get(j, indices[i]));\n\t      }\n\t    }\n\t    return newMatrix;\n\t  }\n\n\t  setSubMatrix(matrix, startRow, startColumn) {\n\t    matrix = Matrix.checkMatrix(matrix);\n\t    if (matrix.isEmpty()) {\n\t      return this;\n\t    }\n\t    let endRow = startRow + matrix.rows - 1;\n\t    let endColumn = startColumn + matrix.columns - 1;\n\t    checkRange(this, startRow, endRow, startColumn, endColumn);\n\t    for (let i = 0; i < matrix.rows; i++) {\n\t      for (let j = 0; j < matrix.columns; j++) {\n\t        this.set(startRow + i, startColumn + j, matrix.get(i, j));\n\t      }\n\t    }\n\t    return this;\n\t  }\n\n\t  selection(rowIndices, columnIndices) {\n\t    checkRowIndices(this, rowIndices);\n\t    checkColumnIndices(this, columnIndices);\n\t    let newMatrix = new Matrix(rowIndices.length, columnIndices.length);\n\t    for (let i = 0; i < rowIndices.length; i++) {\n\t      let rowIndex = rowIndices[i];\n\t      for (let j = 0; j < columnIndices.length; j++) {\n\t        let columnIndex = columnIndices[j];\n\t        newMatrix.set(i, j, this.get(rowIndex, columnIndex));\n\t      }\n\t    }\n\t    return newMatrix;\n\t  }\n\n\t  trace() {\n\t    let min = Math.min(this.rows, this.columns);\n\t    let trace = 0;\n\t    for (let i = 0; i < min; i++) {\n\t      trace += this.get(i, i);\n\t    }\n\t    return trace;\n\t  }\n\n\t  clone() {\n\t    return this.constructor.copy(this, new Matrix(this.rows, this.columns));\n\t  }\n\n\t  /**\n\t   * @template {AbstractMatrix} M\n\t   * @param {AbstractMatrix} from\n\t   * @param {M} to\n\t   * @return {M}\n\t   */\n\t  static copy(from, to) {\n\t    for (const [row, column, value] of from.entries()) {\n\t      to.set(row, column, value);\n\t    }\n\n\t    return to;\n\t  }\n\n\t  sum(by) {\n\t    switch (by) {\n\t      case 'row':\n\t        return sumByRow(this);\n\t      case 'column':\n\t        return sumByColumn(this);\n\t      case undefined:\n\t        return sumAll(this);\n\t      default:\n\t        throw new Error(`invalid option: ${by}`);\n\t    }\n\t  }\n\n\t  product(by) {\n\t    switch (by) {\n\t      case 'row':\n\t        return productByRow(this);\n\t      case 'column':\n\t        return productByColumn(this);\n\t      case undefined:\n\t        return productAll(this);\n\t      default:\n\t        throw new Error(`invalid option: ${by}`);\n\t    }\n\t  }\n\n\t  mean(by) {\n\t    const sum = this.sum(by);\n\t    switch (by) {\n\t      case 'row': {\n\t        for (let i = 0; i < this.rows; i++) {\n\t          sum[i] /= this.columns;\n\t        }\n\t        return sum;\n\t      }\n\t      case 'column': {\n\t        for (let i = 0; i < this.columns; i++) {\n\t          sum[i] /= this.rows;\n\t        }\n\t        return sum;\n\t      }\n\t      case undefined:\n\t        return sum / this.size;\n\t      default:\n\t        throw new Error(`invalid option: ${by}`);\n\t    }\n\t  }\n\n\t  variance(by, options = {}) {\n\t    if (typeof by === 'object') {\n\t      options = by;\n\t      by = undefined;\n\t    }\n\t    if (typeof options !== 'object') {\n\t      throw new TypeError('options must be an object');\n\t    }\n\t    const { unbiased = true, mean = this.mean(by) } = options;\n\t    if (typeof unbiased !== 'boolean') {\n\t      throw new TypeError('unbiased must be a boolean');\n\t    }\n\t    switch (by) {\n\t      case 'row': {\n\t        if (!isAnyArray.isAnyArray(mean)) {\n\t          throw new TypeError('mean must be an array');\n\t        }\n\t        return varianceByRow(this, unbiased, mean);\n\t      }\n\t      case 'column': {\n\t        if (!isAnyArray.isAnyArray(mean)) {\n\t          throw new TypeError('mean must be an array');\n\t        }\n\t        return varianceByColumn(this, unbiased, mean);\n\t      }\n\t      case undefined: {\n\t        if (typeof mean !== 'number') {\n\t          throw new TypeError('mean must be a number');\n\t        }\n\t        return varianceAll(this, unbiased, mean);\n\t      }\n\t      default:\n\t        throw new Error(`invalid option: ${by}`);\n\t    }\n\t  }\n\n\t  standardDeviation(by, options) {\n\t    if (typeof by === 'object') {\n\t      options = by;\n\t      by = undefined;\n\t    }\n\t    const variance = this.variance(by, options);\n\t    if (by === undefined) {\n\t      return Math.sqrt(variance);\n\t    } else {\n\t      for (let i = 0; i < variance.length; i++) {\n\t        variance[i] = Math.sqrt(variance[i]);\n\t      }\n\t      return variance;\n\t    }\n\t  }\n\n\t  center(by, options = {}) {\n\t    if (typeof by === 'object') {\n\t      options = by;\n\t      by = undefined;\n\t    }\n\t    if (typeof options !== 'object') {\n\t      throw new TypeError('options must be an object');\n\t    }\n\t    const { center = this.mean(by) } = options;\n\t    switch (by) {\n\t      case 'row': {\n\t        if (!isAnyArray.isAnyArray(center)) {\n\t          throw new TypeError('center must be an array');\n\t        }\n\t        centerByRow(this, center);\n\t        return this;\n\t      }\n\t      case 'column': {\n\t        if (!isAnyArray.isAnyArray(center)) {\n\t          throw new TypeError('center must be an array');\n\t        }\n\t        centerByColumn(this, center);\n\t        return this;\n\t      }\n\t      case undefined: {\n\t        if (typeof center !== 'number') {\n\t          throw new TypeError('center must be a number');\n\t        }\n\t        centerAll(this, center);\n\t        return this;\n\t      }\n\t      default:\n\t        throw new Error(`invalid option: ${by}`);\n\t    }\n\t  }\n\n\t  scale(by, options = {}) {\n\t    if (typeof by === 'object') {\n\t      options = by;\n\t      by = undefined;\n\t    }\n\t    if (typeof options !== 'object') {\n\t      throw new TypeError('options must be an object');\n\t    }\n\t    let scale = options.scale;\n\t    switch (by) {\n\t      case 'row': {\n\t        if (scale === undefined) {\n\t          scale = getScaleByRow(this);\n\t        } else if (!isAnyArray.isAnyArray(scale)) {\n\t          throw new TypeError('scale must be an array');\n\t        }\n\t        scaleByRow(this, scale);\n\t        return this;\n\t      }\n\t      case 'column': {\n\t        if (scale === undefined) {\n\t          scale = getScaleByColumn(this);\n\t        } else if (!isAnyArray.isAnyArray(scale)) {\n\t          throw new TypeError('scale must be an array');\n\t        }\n\t        scaleByColumn(this, scale);\n\t        return this;\n\t      }\n\t      case undefined: {\n\t        if (scale === undefined) {\n\t          scale = getScaleAll(this);\n\t        } else if (typeof scale !== 'number') {\n\t          throw new TypeError('scale must be a number');\n\t        }\n\t        scaleAll(this, scale);\n\t        return this;\n\t      }\n\t      default:\n\t        throw new Error(`invalid option: ${by}`);\n\t    }\n\t  }\n\n\t  toString(options) {\n\t    return inspectMatrixWithOptions(this, options);\n\t  }\n\n\t  [Symbol.iterator]() {\n\t    return this.entries();\n\t  }\n\n\t  /**\n\t   * iterator from left to right, from top to bottom\n\t   * yield [row, column, value]\n\t   * @returns {Generator<[number, number, number], void, void>}\n\t   */\n\t  *entries() {\n\t    for (let row = 0; row < this.rows; row++) {\n\t      for (let col = 0; col < this.columns; col++) {\n\t        yield [row, col, this.get(row, col)];\n\t      }\n\t    }\n\t  }\n\n\t  /**\n\t   * iterator from left to right, from top to bottom\n\t   * yield value\n\t   * @returns {Generator<number, void, void>}\n\t   */\n\t  *values() {\n\t    for (let row = 0; row < this.rows; row++) {\n\t      for (let col = 0; col < this.columns; col++) {\n\t        yield this.get(row, col);\n\t      }\n\t    }\n\t  }\n\t}\n\n\tAbstractMatrix.prototype.klass = 'Matrix';\n\tif (typeof Symbol !== 'undefined') {\n\t  AbstractMatrix.prototype[Symbol.for('nodejs.util.inspect.custom')] =\n\t    inspectMatrix;\n\t}\n\n\tfunction compareNumbers(a, b) {\n\t  return a - b;\n\t}\n\n\tfunction isArrayOfNumbers(array) {\n\t  return array.every((element) => {\n\t    return typeof element === 'number';\n\t  });\n\t}\n\n\t// Synonyms\n\tAbstractMatrix.random = AbstractMatrix.rand;\n\tAbstractMatrix.randomInt = AbstractMatrix.randInt;\n\tAbstractMatrix.diagonal = AbstractMatrix.diag;\n\tAbstractMatrix.prototype.diagonal = AbstractMatrix.prototype.diag;\n\tAbstractMatrix.identity = AbstractMatrix.eye;\n\tAbstractMatrix.prototype.negate = AbstractMatrix.prototype.neg;\n\tAbstractMatrix.prototype.tensorProduct =\n\t  AbstractMatrix.prototype.kroneckerProduct;\n\n\tclass Matrix extends AbstractMatrix {\n\t  /**\n\t   * @type {Float64Array[]}\n\t   */\n\t  data;\n\n\t  /**\n\t   * Init an empty matrix\n\t   * @param {number} nRows\n\t   * @param {number} nColumns\n\t   */\n\t  #initData(nRows, nColumns) {\n\t    this.data = [];\n\n\t    if (Number.isInteger(nColumns) && nColumns >= 0) {\n\t      for (let i = 0; i < nRows; i++) {\n\t        this.data.push(new Float64Array(nColumns));\n\t      }\n\t    } else {\n\t      throw new TypeError('nColumns must be a positive integer');\n\t    }\n\n\t    this.rows = nRows;\n\t    this.columns = nColumns;\n\t  }\n\n\t  constructor(nRows, nColumns) {\n\t    super();\n\t    if (Matrix.isMatrix(nRows)) {\n\t      this.#initData(nRows.rows, nRows.columns);\n\t      Matrix.copy(nRows, this);\n\t    } else if (Number.isInteger(nRows) && nRows >= 0) {\n\t      this.#initData(nRows, nColumns);\n\t    } else if (isAnyArray.isAnyArray(nRows)) {\n\t      // Copy the values from the 2D array\n\t      const arrayData = nRows;\n\t      nRows = arrayData.length;\n\t      nColumns = nRows ? arrayData[0].length : 0;\n\t      if (typeof nColumns !== 'number') {\n\t        throw new TypeError(\n\t          'Data must be a 2D array with at least one element',\n\t        );\n\t      }\n\t      this.data = [];\n\n\t      for (let i = 0; i < nRows; i++) {\n\t        if (arrayData[i].length !== nColumns) {\n\t          throw new RangeError('Inconsistent array dimensions');\n\t        }\n\t        if (!isArrayOfNumbers(arrayData[i])) {\n\t          throw new TypeError('Input data contains non-numeric values');\n\t        }\n\t        this.data.push(Float64Array.from(arrayData[i]));\n\t      }\n\n\t      this.rows = nRows;\n\t      this.columns = nColumns;\n\t    } else {\n\t      throw new TypeError(\n\t        'First argument must be a positive number or an array',\n\t      );\n\t    }\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.data[rowIndex][columnIndex] = value;\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.data[rowIndex][columnIndex];\n\t  }\n\n\t  removeRow(index) {\n\t    checkRowIndex(this, index);\n\t    this.data.splice(index, 1);\n\t    this.rows -= 1;\n\t    return this;\n\t  }\n\n\t  addRow(index, array) {\n\t    if (array === undefined) {\n\t      array = index;\n\t      index = this.rows;\n\t    }\n\t    checkRowIndex(this, index, true);\n\t    array = Float64Array.from(checkRowVector(this, array));\n\t    this.data.splice(index, 0, array);\n\t    this.rows += 1;\n\t    return this;\n\t  }\n\n\t  removeColumn(index) {\n\t    checkColumnIndex(this, index);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      const newRow = new Float64Array(this.columns - 1);\n\t      for (let j = 0; j < index; j++) {\n\t        newRow[j] = this.data[i][j];\n\t      }\n\t      for (let j = index + 1; j < this.columns; j++) {\n\t        newRow[j - 1] = this.data[i][j];\n\t      }\n\t      this.data[i] = newRow;\n\t    }\n\t    this.columns -= 1;\n\t    return this;\n\t  }\n\n\t  addColumn(index, array) {\n\t    if (typeof array === 'undefined') {\n\t      array = index;\n\t      index = this.columns;\n\t    }\n\t    checkColumnIndex(this, index, true);\n\t    array = checkColumnVector(this, array);\n\t    for (let i = 0; i < this.rows; i++) {\n\t      const newRow = new Float64Array(this.columns + 1);\n\t      let j = 0;\n\t      for (; j < index; j++) {\n\t        newRow[j] = this.data[i][j];\n\t      }\n\t      newRow[j++] = array[i];\n\t      for (; j < this.columns + 1; j++) {\n\t        newRow[j] = this.data[i][j - 1];\n\t      }\n\t      this.data[i] = newRow;\n\t    }\n\t    this.columns += 1;\n\t    return this;\n\t  }\n\t}\n\n\tinstallMathOperations(AbstractMatrix, Matrix);\n\n\t/**\n\t * @typedef {0 | 1 | number | boolean} Mask\n\t */\n\n\tclass SymmetricMatrix extends AbstractMatrix {\n\t  /** @type {Matrix} */\n\t  #matrix;\n\n\t  get size() {\n\t    return this.#matrix.size;\n\t  }\n\n\t  get rows() {\n\t    return this.#matrix.rows;\n\t  }\n\n\t  get columns() {\n\t    return this.#matrix.columns;\n\t  }\n\n\t  get diagonalSize() {\n\t    return this.rows;\n\t  }\n\n\t  /**\n\t   * not the same as matrix.isSymmetric()\n\t   * Here is to check if it's instanceof SymmetricMatrix without bundling issues\n\t   *\n\t   * @param value\n\t   * @returns {boolean}\n\t   */\n\t  static isSymmetricMatrix(value) {\n\t    return Matrix.isMatrix(value) && value.klassType === 'SymmetricMatrix';\n\t  }\n\n\t  /**\n\t   * @param diagonalSize\n\t   * @return {SymmetricMatrix}\n\t   */\n\t  static zeros(diagonalSize) {\n\t    return new this(diagonalSize);\n\t  }\n\n\t  /**\n\t   * @param diagonalSize\n\t   * @return {SymmetricMatrix}\n\t   */\n\t  static ones(diagonalSize) {\n\t    return new this(diagonalSize).fill(1);\n\t  }\n\n\t  /**\n\t   * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize\n\t   * @return {this}\n\t   */\n\t  constructor(diagonalSize) {\n\t    super();\n\n\t    if (Matrix.isMatrix(diagonalSize)) {\n\t      if (!diagonalSize.isSymmetric()) {\n\t        throw new TypeError('not symmetric data');\n\t      }\n\n\t      this.#matrix = Matrix.copy(\n\t        diagonalSize,\n\t        new Matrix(diagonalSize.rows, diagonalSize.rows),\n\t      );\n\t    } else if (Number.isInteger(diagonalSize) && diagonalSize >= 0) {\n\t      this.#matrix = new Matrix(diagonalSize, diagonalSize);\n\t    } else {\n\t      this.#matrix = new Matrix(diagonalSize);\n\n\t      if (!this.isSymmetric()) {\n\t        throw new TypeError('not symmetric data');\n\t      }\n\t    }\n\t  }\n\n\t  clone() {\n\t    const matrix = new SymmetricMatrix(this.diagonalSize);\n\n\t    for (const [row, col, value] of this.upperRightEntries()) {\n\t      matrix.set(row, col, value);\n\t    }\n\n\t    return matrix;\n\t  }\n\n\t  toMatrix() {\n\t    return new Matrix(this);\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.#matrix.get(rowIndex, columnIndex);\n\t  }\n\t  set(rowIndex, columnIndex, value) {\n\t    // symmetric set\n\t    this.#matrix.set(rowIndex, columnIndex, value);\n\t    this.#matrix.set(columnIndex, rowIndex, value);\n\n\t    return this;\n\t  }\n\n\t  removeCross(index) {\n\t    // symmetric remove side\n\t    this.#matrix.removeRow(index);\n\t    this.#matrix.removeColumn(index);\n\n\t    return this;\n\t  }\n\n\t  addCross(index, array) {\n\t    if (array === undefined) {\n\t      array = index;\n\t      index = this.diagonalSize;\n\t    }\n\n\t    const row = array.slice();\n\t    row.splice(index, 1);\n\n\t    this.#matrix.addRow(index, row);\n\t    this.#matrix.addColumn(index, array);\n\n\t    return this;\n\t  }\n\n\t  /**\n\t   * @param {Mask[]} mask\n\t   */\n\t  applyMask(mask) {\n\t    if (mask.length !== this.diagonalSize) {\n\t      throw new RangeError('Mask size do not match with matrix size');\n\t    }\n\n\t    // prepare sides to remove from matrix from mask\n\t    /** @type {number[]} */\n\t    const sidesToRemove = [];\n\t    for (const [index, passthroughs] of mask.entries()) {\n\t      if (passthroughs) continue;\n\t      sidesToRemove.push(index);\n\t    }\n\t    // to remove from highest to lowest for no mutation shifting\n\t    sidesToRemove.reverse();\n\n\t    // remove sides\n\t    for (const sideIndex of sidesToRemove) {\n\t      this.removeCross(sideIndex);\n\t    }\n\n\t    return this;\n\t  }\n\n\t  /**\n\t   * Compact format upper-right corner of matrix\n\t   * iterate from left to right, from top to bottom.\n\t   *\n\t   * ```\n\t   *   A B C D\n\t   * A 1 2 3 4\n\t   * B 2 5 6 7\n\t   * C 3 6 8 9\n\t   * D 4 7 9 10\n\t   * ```\n\t   *\n\t   * will return compact 1D array `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]`\n\t   *\n\t   * length is S(i=0, n=sideSize) => 10 for a 4 sideSized matrix\n\t   *\n\t   * @returns {number[]}\n\t   */\n\t  toCompact() {\n\t    const { diagonalSize } = this;\n\n\t    /** @type {number[]} */\n\t    const compact = new Array((diagonalSize * (diagonalSize + 1)) / 2);\n\t    for (let col = 0, row = 0, index = 0; index < compact.length; index++) {\n\t      compact[index] = this.get(row, col);\n\n\t      if (++col >= diagonalSize) col = ++row;\n\t    }\n\n\t    return compact;\n\t  }\n\n\t  /**\n\t   * @param {number[]} compact\n\t   * @return {SymmetricMatrix}\n\t   */\n\t  static fromCompact(compact) {\n\t    const compactSize = compact.length;\n\t    // compactSize = (sideSize * (sideSize + 1)) / 2\n\t    // https://mathsolver.microsoft.com/fr/solve-problem/y%20%3D%20%20x%20%60cdot%20%20%20%60frac%7B%20%20%60left(%20x%2B1%20%20%60right)%20%20%20%20%7D%7B%202%20%20%7D\n\t    // sideSize = (Sqrt(8 × compactSize + 1) - 1) / 2\n\t    const diagonalSize = (Math.sqrt(8 * compactSize + 1) - 1) / 2;\n\n\t    if (!Number.isInteger(diagonalSize)) {\n\t      throw new TypeError(\n\t        `This array is not a compact representation of a Symmetric Matrix, ${JSON.stringify(\n\t          compact,\n\t        )}`,\n\t      );\n\t    }\n\n\t    const matrix = new SymmetricMatrix(diagonalSize);\n\t    for (let col = 0, row = 0, index = 0; index < compactSize; index++) {\n\t      matrix.set(col, row, compact[index]);\n\t      if (++col >= diagonalSize) col = ++row;\n\t    }\n\n\t    return matrix;\n\t  }\n\n\t  /**\n\t   * half iterator upper-right-corner from left to right, from top to bottom\n\t   * yield [row, column, value]\n\t   *\n\t   * @returns {Generator<[number, number, number], void, void>}\n\t   */\n\t  *upperRightEntries() {\n\t    for (let row = 0, col = 0; row < this.diagonalSize; void 0) {\n\t      const value = this.get(row, col);\n\n\t      yield [row, col, value];\n\n\t      // at the end of row, move cursor to next row at diagonal position\n\t      if (++col >= this.diagonalSize) col = ++row;\n\t    }\n\t  }\n\n\t  /**\n\t   * half iterator upper-right-corner from left to right, from top to bottom\n\t   * yield value\n\t   *\n\t   * @returns {Generator<[number, number, number], void, void>}\n\t   */\n\t  *upperRightValues() {\n\t    for (let row = 0, col = 0; row < this.diagonalSize; void 0) {\n\t      const value = this.get(row, col);\n\n\t      yield value;\n\n\t      // at the end of row, move cursor to next row at diagonal position\n\t      if (++col >= this.diagonalSize) col = ++row;\n\t    }\n\t  }\n\t}\n\tSymmetricMatrix.prototype.klassType = 'SymmetricMatrix';\n\n\tclass DistanceMatrix extends SymmetricMatrix {\n\t  /**\n\t   * not the same as matrix.isSymmetric()\n\t   * Here is to check if it's instanceof SymmetricMatrix without bundling issues\n\t   *\n\t   * @param value\n\t   * @returns {boolean}\n\t   */\n\t  static isDistanceMatrix(value) {\n\t    return (\n\t      SymmetricMatrix.isSymmetricMatrix(value) &&\n\t      value.klassSubType === 'DistanceMatrix'\n\t    );\n\t  }\n\n\t  constructor(sideSize) {\n\t    super(sideSize);\n\n\t    if (!this.isDistance()) {\n\t      throw new TypeError('Provided arguments do no produce a distance matrix');\n\t    }\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    // distance matrix diagonal is 0\n\t    if (rowIndex === columnIndex) value = 0;\n\n\t    return super.set(rowIndex, columnIndex, value);\n\t  }\n\n\t  addCross(index, array) {\n\t    if (array === undefined) {\n\t      array = index;\n\t      index = this.diagonalSize;\n\t    }\n\n\t    // ensure distance\n\t    array = array.slice();\n\t    array[index] = 0;\n\n\t    return super.addCross(index, array);\n\t  }\n\n\t  toSymmetricMatrix() {\n\t    return new SymmetricMatrix(this);\n\t  }\n\n\t  clone() {\n\t    const matrix = new DistanceMatrix(this.diagonalSize);\n\n\t    for (const [row, col, value] of this.upperRightEntries()) {\n\t      if (row === col) continue;\n\t      matrix.set(row, col, value);\n\t    }\n\n\t    return matrix;\n\t  }\n\n\t  /**\n\t   * Compact format upper-right corner of matrix\n\t   * no diagonal (only zeros)\n\t   * iterable from left to right, from top to bottom.\n\t   *\n\t   * ```\n\t   *   A B C D\n\t   * A 0 1 2 3\n\t   * B 1 0 4 5\n\t   * C 2 4 0 6\n\t   * D 3 5 6 0\n\t   * ```\n\t   *\n\t   * will return compact 1D array `[1, 2, 3, 4, 5, 6]`\n\t   *\n\t   * length is S(i=0, n=sideSize-1) => 6 for a 4 side sized matrix\n\t   *\n\t   * @returns {number[]}\n\t   */\n\t  toCompact() {\n\t    const { diagonalSize } = this;\n\t    const compactLength = ((diagonalSize - 1) * diagonalSize) / 2;\n\n\t    /** @type {number[]} */\n\t    const compact = new Array(compactLength);\n\t    for (let col = 1, row = 0, index = 0; index < compact.length; index++) {\n\t      compact[index] = this.get(row, col);\n\n\t      if (++col >= diagonalSize) col = ++row + 1;\n\t    }\n\n\t    return compact;\n\t  }\n\n\t  /**\n\t   * @param {number[]} compact\n\t   */\n\t  static fromCompact(compact) {\n\t    const compactSize = compact.length;\n\n\t    if (compactSize === 0) {\n\t      return new this(0);\n\t    }\n\n\t    // compactSize in Natural integer range ]0;∞]\n\t    // compactSize = (sideSize * (sideSize - 1)) / 2\n\t    // sideSize = (Sqrt(8 × compactSize + 1) + 1) / 2\n\t    const diagonalSize = (Math.sqrt(8 * compactSize + 1) + 1) / 2;\n\n\t    if (!Number.isInteger(diagonalSize)) {\n\t      throw new TypeError(\n\t        `This array is not a compact representation of a DistanceMatrix, ${JSON.stringify(\n\t          compact,\n\t        )}`,\n\t      );\n\t    }\n\n\t    const matrix = new this(diagonalSize);\n\t    for (let col = 1, row = 0, index = 0; index < compactSize; index++) {\n\t      matrix.set(col, row, compact[index]);\n\t      if (++col >= diagonalSize) col = ++row + 1;\n\t    }\n\n\t    return matrix;\n\t  }\n\t}\n\tDistanceMatrix.prototype.klassSubType = 'DistanceMatrix';\n\n\tclass BaseView extends AbstractMatrix {\n\t  constructor(matrix, rows, columns) {\n\t    super();\n\t    this.matrix = matrix;\n\t    this.rows = rows;\n\t    this.columns = columns;\n\t  }\n\t}\n\n\tclass MatrixColumnView extends BaseView {\n\t  constructor(matrix, column) {\n\t    checkColumnIndex(matrix, column);\n\t    super(matrix, matrix.rows, 1);\n\t    this.column = column;\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(rowIndex, this.column, value);\n\t    return this;\n\t  }\n\n\t  get(rowIndex) {\n\t    return this.matrix.get(rowIndex, this.column);\n\t  }\n\t}\n\n\tclass MatrixColumnSelectionView extends BaseView {\n\t  constructor(matrix, columnIndices) {\n\t    checkColumnIndices(matrix, columnIndices);\n\t    super(matrix, matrix.rows, columnIndices.length);\n\t    this.columnIndices = columnIndices;\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(rowIndex, this.columnIndices[columnIndex], value);\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.matrix.get(rowIndex, this.columnIndices[columnIndex]);\n\t  }\n\t}\n\n\tclass MatrixFlipColumnView extends BaseView {\n\t  constructor(matrix) {\n\t    super(matrix, matrix.rows, matrix.columns);\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(rowIndex, this.columns - columnIndex - 1, value);\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.matrix.get(rowIndex, this.columns - columnIndex - 1);\n\t  }\n\t}\n\n\tclass MatrixFlipRowView extends BaseView {\n\t  constructor(matrix) {\n\t    super(matrix, matrix.rows, matrix.columns);\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(this.rows - rowIndex - 1, columnIndex, value);\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.matrix.get(this.rows - rowIndex - 1, columnIndex);\n\t  }\n\t}\n\n\tclass MatrixRowView extends BaseView {\n\t  constructor(matrix, row) {\n\t    checkRowIndex(matrix, row);\n\t    super(matrix, 1, matrix.columns);\n\t    this.row = row;\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(this.row, columnIndex, value);\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.matrix.get(this.row, columnIndex);\n\t  }\n\t}\n\n\tclass MatrixRowSelectionView extends BaseView {\n\t  constructor(matrix, rowIndices) {\n\t    checkRowIndices(matrix, rowIndices);\n\t    super(matrix, rowIndices.length, matrix.columns);\n\t    this.rowIndices = rowIndices;\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(this.rowIndices[rowIndex], columnIndex, value);\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.matrix.get(this.rowIndices[rowIndex], columnIndex);\n\t  }\n\t}\n\n\tclass MatrixSelectionView extends BaseView {\n\t  constructor(matrix, rowIndices, columnIndices) {\n\t    checkRowIndices(matrix, rowIndices);\n\t    checkColumnIndices(matrix, columnIndices);\n\t    super(matrix, rowIndices.length, columnIndices.length);\n\t    this.rowIndices = rowIndices;\n\t    this.columnIndices = columnIndices;\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(\n\t      this.rowIndices[rowIndex],\n\t      this.columnIndices[columnIndex],\n\t      value,\n\t    );\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.matrix.get(\n\t      this.rowIndices[rowIndex],\n\t      this.columnIndices[columnIndex],\n\t    );\n\t  }\n\t}\n\n\tclass MatrixSubView extends BaseView {\n\t  constructor(matrix, startRow, endRow, startColumn, endColumn) {\n\t    checkRange(matrix, startRow, endRow, startColumn, endColumn);\n\t    super(matrix, endRow - startRow + 1, endColumn - startColumn + 1);\n\t    this.startRow = startRow;\n\t    this.startColumn = startColumn;\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(\n\t      this.startRow + rowIndex,\n\t      this.startColumn + columnIndex,\n\t      value,\n\t    );\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.matrix.get(\n\t      this.startRow + rowIndex,\n\t      this.startColumn + columnIndex,\n\t    );\n\t  }\n\t}\n\n\tclass MatrixTransposeView extends BaseView {\n\t  constructor(matrix) {\n\t    super(matrix, matrix.columns, matrix.rows);\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.matrix.set(columnIndex, rowIndex, value);\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.matrix.get(columnIndex, rowIndex);\n\t  }\n\t}\n\n\tclass WrapperMatrix1D extends AbstractMatrix {\n\t  constructor(data, options = {}) {\n\t    const { rows = 1 } = options;\n\n\t    if (data.length % rows !== 0) {\n\t      throw new Error('the data length is not divisible by the number of rows');\n\t    }\n\t    super();\n\t    this.rows = rows;\n\t    this.columns = data.length / rows;\n\t    this.data = data;\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    let index = this._calculateIndex(rowIndex, columnIndex);\n\t    this.data[index] = value;\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    let index = this._calculateIndex(rowIndex, columnIndex);\n\t    return this.data[index];\n\t  }\n\n\t  _calculateIndex(row, column) {\n\t    return row * this.columns + column;\n\t  }\n\t}\n\n\tclass WrapperMatrix2D extends AbstractMatrix {\n\t  constructor(data) {\n\t    super();\n\t    this.data = data;\n\t    this.rows = data.length;\n\t    this.columns = data[0].length;\n\t  }\n\n\t  set(rowIndex, columnIndex, value) {\n\t    this.data[rowIndex][columnIndex] = value;\n\t    return this;\n\t  }\n\n\t  get(rowIndex, columnIndex) {\n\t    return this.data[rowIndex][columnIndex];\n\t  }\n\t}\n\n\tfunction wrap(array, options) {\n\t  if (isAnyArray.isAnyArray(array)) {\n\t    if (array[0] && isAnyArray.isAnyArray(array[0])) {\n\t      return new WrapperMatrix2D(array);\n\t    } else {\n\t      return new WrapperMatrix1D(array, options);\n\t    }\n\t  } else {\n\t    throw new Error('the argument is not an array');\n\t  }\n\t}\n\n\tclass LuDecomposition {\n\t  constructor(matrix) {\n\t    matrix = WrapperMatrix2D.checkMatrix(matrix);\n\n\t    let lu = matrix.clone();\n\t    let rows = lu.rows;\n\t    let columns = lu.columns;\n\t    let pivotVector = new Float64Array(rows);\n\t    let pivotSign = 1;\n\t    let i, j, k, p, s, t, v;\n\t    let LUcolj, kmax;\n\n\t    for (i = 0; i < rows; i++) {\n\t      pivotVector[i] = i;\n\t    }\n\n\t    LUcolj = new Float64Array(rows);\n\n\t    for (j = 0; j < columns; j++) {\n\t      for (i = 0; i < rows; i++) {\n\t        LUcolj[i] = lu.get(i, j);\n\t      }\n\n\t      for (i = 0; i < rows; i++) {\n\t        kmax = Math.min(i, j);\n\t        s = 0;\n\t        for (k = 0; k < kmax; k++) {\n\t          s += lu.get(i, k) * LUcolj[k];\n\t        }\n\t        LUcolj[i] -= s;\n\t        lu.set(i, j, LUcolj[i]);\n\t      }\n\n\t      p = j;\n\t      for (i = j + 1; i < rows; i++) {\n\t        if (Math.abs(LUcolj[i]) > Math.abs(LUcolj[p])) {\n\t          p = i;\n\t        }\n\t      }\n\n\t      if (p !== j) {\n\t        for (k = 0; k < columns; k++) {\n\t          t = lu.get(p, k);\n\t          lu.set(p, k, lu.get(j, k));\n\t          lu.set(j, k, t);\n\t        }\n\n\t        v = pivotVector[p];\n\t        pivotVector[p] = pivotVector[j];\n\t        pivotVector[j] = v;\n\n\t        pivotSign = -pivotSign;\n\t      }\n\n\t      if (j < rows && lu.get(j, j) !== 0) {\n\t        for (i = j + 1; i < rows; i++) {\n\t          lu.set(i, j, lu.get(i, j) / lu.get(j, j));\n\t        }\n\t      }\n\t    }\n\n\t    this.LU = lu;\n\t    this.pivotVector = pivotVector;\n\t    this.pivotSign = pivotSign;\n\t  }\n\n\t  isSingular() {\n\t    let data = this.LU;\n\t    let col = data.columns;\n\t    for (let j = 0; j < col; j++) {\n\t      if (data.get(j, j) === 0) {\n\t        return true;\n\t      }\n\t    }\n\t    return false;\n\t  }\n\n\t  solve(value) {\n\t    value = Matrix.checkMatrix(value);\n\n\t    let lu = this.LU;\n\t    let rows = lu.rows;\n\n\t    if (rows !== value.rows) {\n\t      throw new Error('Invalid matrix dimensions');\n\t    }\n\t    if (this.isSingular()) {\n\t      throw new Error('LU matrix is singular');\n\t    }\n\n\t    let count = value.columns;\n\t    let X = value.subMatrixRow(this.pivotVector, 0, count - 1);\n\t    let columns = lu.columns;\n\t    let i, j, k;\n\n\t    for (k = 0; k < columns; k++) {\n\t      for (i = k + 1; i < columns; i++) {\n\t        for (j = 0; j < count; j++) {\n\t          X.set(i, j, X.get(i, j) - X.get(k, j) * lu.get(i, k));\n\t        }\n\t      }\n\t    }\n\t    for (k = columns - 1; k >= 0; k--) {\n\t      for (j = 0; j < count; j++) {\n\t        X.set(k, j, X.get(k, j) / lu.get(k, k));\n\t      }\n\t      for (i = 0; i < k; i++) {\n\t        for (j = 0; j < count; j++) {\n\t          X.set(i, j, X.get(i, j) - X.get(k, j) * lu.get(i, k));\n\t        }\n\t      }\n\t    }\n\t    return X;\n\t  }\n\n\t  get determinant() {\n\t    let data = this.LU;\n\t    if (!data.isSquare()) {\n\t      throw new Error('Matrix must be square');\n\t    }\n\t    let determinant = this.pivotSign;\n\t    let col = data.columns;\n\t    for (let j = 0; j < col; j++) {\n\t      determinant *= data.get(j, j);\n\t    }\n\t    return determinant;\n\t  }\n\n\t  get lowerTriangularMatrix() {\n\t    let data = this.LU;\n\t    let rows = data.rows;\n\t    let columns = data.columns;\n\t    let X = new Matrix(rows, columns);\n\t    for (let i = 0; i < rows; i++) {\n\t      for (let j = 0; j < columns; j++) {\n\t        if (i > j) {\n\t          X.set(i, j, data.get(i, j));\n\t        } else if (i === j) {\n\t          X.set(i, j, 1);\n\t        } else {\n\t          X.set(i, j, 0);\n\t        }\n\t      }\n\t    }\n\t    return X;\n\t  }\n\n\t  get upperTriangularMatrix() {\n\t    let data = this.LU;\n\t    let rows = data.rows;\n\t    let columns = data.columns;\n\t    let X = new Matrix(rows, columns);\n\t    for (let i = 0; i < rows; i++) {\n\t      for (let j = 0; j < columns; j++) {\n\t        if (i <= j) {\n\t          X.set(i, j, data.get(i, j));\n\t        } else {\n\t          X.set(i, j, 0);\n\t        }\n\t      }\n\t    }\n\t    return X;\n\t  }\n\n\t  get pivotPermutationVector() {\n\t    return Array.from(this.pivotVector);\n\t  }\n\t}\n\n\tfunction hypotenuse(a, b) {\n\t  let r = 0;\n\t  if (Math.abs(a) > Math.abs(b)) {\n\t    r = b / a;\n\t    return Math.abs(a) * Math.sqrt(1 + r * r);\n\t  }\n\t  if (b !== 0) {\n\t    r = a / b;\n\t    return Math.abs(b) * Math.sqrt(1 + r * r);\n\t  }\n\t  return 0;\n\t}\n\n\tclass QrDecomposition {\n\t  constructor(value) {\n\t    value = WrapperMatrix2D.checkMatrix(value);\n\n\t    let qr = value.clone();\n\t    let m = value.rows;\n\t    let n = value.columns;\n\t    let rdiag = new Float64Array(n);\n\t    let i, j, k, s;\n\n\t    for (k = 0; k < n; k++) {\n\t      let nrm = 0;\n\t      for (i = k; i < m; i++) {\n\t        nrm = hypotenuse(nrm, qr.get(i, k));\n\t      }\n\t      if (nrm !== 0) {\n\t        if (qr.get(k, k) < 0) {\n\t          nrm = -nrm;\n\t        }\n\t        for (i = k; i < m; i++) {\n\t          qr.set(i, k, qr.get(i, k) / nrm);\n\t        }\n\t        qr.set(k, k, qr.get(k, k) + 1);\n\t        for (j = k + 1; j < n; j++) {\n\t          s = 0;\n\t          for (i = k; i < m; i++) {\n\t            s += qr.get(i, k) * qr.get(i, j);\n\t          }\n\t          s = -s / qr.get(k, k);\n\t          for (i = k; i < m; i++) {\n\t            qr.set(i, j, qr.get(i, j) + s * qr.get(i, k));\n\t          }\n\t        }\n\t      }\n\t      rdiag[k] = -nrm;\n\t    }\n\n\t    this.QR = qr;\n\t    this.Rdiag = rdiag;\n\t  }\n\n\t  solve(value) {\n\t    value = Matrix.checkMatrix(value);\n\n\t    let qr = this.QR;\n\t    let m = qr.rows;\n\n\t    if (value.rows !== m) {\n\t      throw new Error('Matrix row dimensions must agree');\n\t    }\n\t    if (!this.isFullRank()) {\n\t      throw new Error('Matrix is rank deficient');\n\t    }\n\n\t    let count = value.columns;\n\t    let X = value.clone();\n\t    let n = qr.columns;\n\t    let i, j, k, s;\n\n\t    for (k = 0; k < n; k++) {\n\t      for (j = 0; j < count; j++) {\n\t        s = 0;\n\t        for (i = k; i < m; i++) {\n\t          s += qr.get(i, k) * X.get(i, j);\n\t        }\n\t        s = -s / qr.get(k, k);\n\t        for (i = k; i < m; i++) {\n\t          X.set(i, j, X.get(i, j) + s * qr.get(i, k));\n\t        }\n\t      }\n\t    }\n\t    for (k = n - 1; k >= 0; k--) {\n\t      for (j = 0; j < count; j++) {\n\t        X.set(k, j, X.get(k, j) / this.Rdiag[k]);\n\t      }\n\t      for (i = 0; i < k; i++) {\n\t        for (j = 0; j < count; j++) {\n\t          X.set(i, j, X.get(i, j) - X.get(k, j) * qr.get(i, k));\n\t        }\n\t      }\n\t    }\n\n\t    return X.subMatrix(0, n - 1, 0, count - 1);\n\t  }\n\n\t  isFullRank() {\n\t    let columns = this.QR.columns;\n\t    for (let i = 0; i < columns; i++) {\n\t      if (this.Rdiag[i] === 0) {\n\t        return false;\n\t      }\n\t    }\n\t    return true;\n\t  }\n\n\t  get upperTriangularMatrix() {\n\t    let qr = this.QR;\n\t    let n = qr.columns;\n\t    let X = new Matrix(n, n);\n\t    let i, j;\n\t    for (i = 0; i < n; i++) {\n\t      for (j = 0; j < n; j++) {\n\t        if (i < j) {\n\t          X.set(i, j, qr.get(i, j));\n\t        } else if (i === j) {\n\t          X.set(i, j, this.Rdiag[i]);\n\t        } else {\n\t          X.set(i, j, 0);\n\t        }\n\t      }\n\t    }\n\t    return X;\n\t  }\n\n\t  get orthogonalMatrix() {\n\t    let qr = this.QR;\n\t    let rows = qr.rows;\n\t    let columns = qr.columns;\n\t    let X = new Matrix(rows, columns);\n\t    let i, j, k, s;\n\n\t    for (k = columns - 1; k >= 0; k--) {\n\t      for (i = 0; i < rows; i++) {\n\t        X.set(i, k, 0);\n\t      }\n\t      X.set(k, k, 1);\n\t      for (j = k; j < columns; j++) {\n\t        if (qr.get(k, k) !== 0) {\n\t          s = 0;\n\t          for (i = k; i < rows; i++) {\n\t            s += qr.get(i, k) * X.get(i, j);\n\t          }\n\n\t          s = -s / qr.get(k, k);\n\n\t          for (i = k; i < rows; i++) {\n\t            X.set(i, j, X.get(i, j) + s * qr.get(i, k));\n\t          }\n\t        }\n\t      }\n\t    }\n\t    return X;\n\t  }\n\t}\n\n\tclass SingularValueDecomposition {\n\t  constructor(value, options = {}) {\n\t    value = WrapperMatrix2D.checkMatrix(value);\n\n\t    if (value.isEmpty()) {\n\t      throw new Error('Matrix must be non-empty');\n\t    }\n\n\t    let m = value.rows;\n\t    let n = value.columns;\n\n\t    const {\n\t      computeLeftSingularVectors = true,\n\t      computeRightSingularVectors = true,\n\t      autoTranspose = false,\n\t    } = options;\n\n\t    let wantu = Boolean(computeLeftSingularVectors);\n\t    let wantv = Boolean(computeRightSingularVectors);\n\n\t    let swapped = false;\n\t    let a;\n\t    if (m < n) {\n\t      if (!autoTranspose) {\n\t        a = value.clone();\n\t        // eslint-disable-next-line no-console\n\t        console.warn(\n\t          'Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose',\n\t        );\n\t      } else {\n\t        a = value.transpose();\n\t        m = a.rows;\n\t        n = a.columns;\n\t        swapped = true;\n\t        let aux = wantu;\n\t        wantu = wantv;\n\t        wantv = aux;\n\t      }\n\t    } else {\n\t      a = value.clone();\n\t    }\n\n\t    let nu = Math.min(m, n);\n\t    let ni = Math.min(m + 1, n);\n\t    let s = new Float64Array(ni);\n\t    let U = new Matrix(m, nu);\n\t    let V = new Matrix(n, n);\n\n\t    let e = new Float64Array(n);\n\t    let work = new Float64Array(m);\n\n\t    let si = new Float64Array(ni);\n\t    for (let i = 0; i < ni; i++) si[i] = i;\n\n\t    let nct = Math.min(m - 1, n);\n\t    let nrt = Math.max(0, Math.min(n - 2, m));\n\t    let mrc = Math.max(nct, nrt);\n\n\t    for (let k = 0; k < mrc; k++) {\n\t      if (k < nct) {\n\t        s[k] = 0;\n\t        for (let i = k; i < m; i++) {\n\t          s[k] = hypotenuse(s[k], a.get(i, k));\n\t        }\n\t        if (s[k] !== 0) {\n\t          if (a.get(k, k) < 0) {\n\t            s[k] = -s[k];\n\t          }\n\t          for (let i = k; i < m; i++) {\n\t            a.set(i, k, a.get(i, k) / s[k]);\n\t          }\n\t          a.set(k, k, a.get(k, k) + 1);\n\t        }\n\t        s[k] = -s[k];\n\t      }\n\n\t      for (let j = k + 1; j < n; j++) {\n\t        if (k < nct && s[k] !== 0) {\n\t          let t = 0;\n\t          for (let i = k; i < m; i++) {\n\t            t += a.get(i, k) * a.get(i, j);\n\t          }\n\t          t = -t / a.get(k, k);\n\t          for (let i = k; i < m; i++) {\n\t            a.set(i, j, a.get(i, j) + t * a.get(i, k));\n\t          }\n\t        }\n\t        e[j] = a.get(k, j);\n\t      }\n\n\t      if (wantu && k < nct) {\n\t        for (let i = k; i < m; i++) {\n\t          U.set(i, k, a.get(i, k));\n\t        }\n\t      }\n\n\t      if (k < nrt) {\n\t        e[k] = 0;\n\t        for (let i = k + 1; i < n; i++) {\n\t          e[k] = hypotenuse(e[k], e[i]);\n\t        }\n\t        if (e[k] !== 0) {\n\t          if (e[k + 1] < 0) {\n\t            e[k] = 0 - e[k];\n\t          }\n\t          for (let i = k + 1; i < n; i++) {\n\t            e[i] /= e[k];\n\t          }\n\t          e[k + 1] += 1;\n\t        }\n\t        e[k] = -e[k];\n\t        if (k + 1 < m && e[k] !== 0) {\n\t          for (let i = k + 1; i < m; i++) {\n\t            work[i] = 0;\n\t          }\n\t          for (let i = k + 1; i < m; i++) {\n\t            for (let j = k + 1; j < n; j++) {\n\t              work[i] += e[j] * a.get(i, j);\n\t            }\n\t          }\n\t          for (let j = k + 1; j < n; j++) {\n\t            let t = -e[j] / e[k + 1];\n\t            for (let i = k + 1; i < m; i++) {\n\t              a.set(i, j, a.get(i, j) + t * work[i]);\n\t            }\n\t          }\n\t        }\n\t        if (wantv) {\n\t          for (let i = k + 1; i < n; i++) {\n\t            V.set(i, k, e[i]);\n\t          }\n\t        }\n\t      }\n\t    }\n\n\t    let p = Math.min(n, m + 1);\n\t    if (nct < n) {\n\t      s[nct] = a.get(nct, nct);\n\t    }\n\t    if (m < p) {\n\t      s[p - 1] = 0;\n\t    }\n\t    if (nrt + 1 < p) {\n\t      e[nrt] = a.get(nrt, p - 1);\n\t    }\n\t    e[p - 1] = 0;\n\n\t    if (wantu) {\n\t      for (let j = nct; j < nu; j++) {\n\t        for (let i = 0; i < m; i++) {\n\t          U.set(i, j, 0);\n\t        }\n\t        U.set(j, j, 1);\n\t      }\n\t      for (let k = nct - 1; k >= 0; k--) {\n\t        if (s[k] !== 0) {\n\t          for (let j = k + 1; j < nu; j++) {\n\t            let t = 0;\n\t            for (let i = k; i < m; i++) {\n\t              t += U.get(i, k) * U.get(i, j);\n\t            }\n\t            t = -t / U.get(k, k);\n\t            for (let i = k; i < m; i++) {\n\t              U.set(i, j, U.get(i, j) + t * U.get(i, k));\n\t            }\n\t          }\n\t          for (let i = k; i < m; i++) {\n\t            U.set(i, k, -U.get(i, k));\n\t          }\n\t          U.set(k, k, 1 + U.get(k, k));\n\t          for (let i = 0; i < k - 1; i++) {\n\t            U.set(i, k, 0);\n\t          }\n\t        } else {\n\t          for (let i = 0; i < m; i++) {\n\t            U.set(i, k, 0);\n\t          }\n\t          U.set(k, k, 1);\n\t        }\n\t      }\n\t    }\n\n\t    if (wantv) {\n\t      for (let k = n - 1; k >= 0; k--) {\n\t        if (k < nrt && e[k] !== 0) {\n\t          for (let j = k + 1; j < n; j++) {\n\t            let t = 0;\n\t            for (let i = k + 1; i < n; i++) {\n\t              t += V.get(i, k) * V.get(i, j);\n\t            }\n\t            t = -t / V.get(k + 1, k);\n\t            for (let i = k + 1; i < n; i++) {\n\t              V.set(i, j, V.get(i, j) + t * V.get(i, k));\n\t            }\n\t          }\n\t        }\n\t        for (let i = 0; i < n; i++) {\n\t          V.set(i, k, 0);\n\t        }\n\t        V.set(k, k, 1);\n\t      }\n\t    }\n\n\t    let pp = p - 1;\n\t    let eps = Number.EPSILON;\n\t    while (p > 0) {\n\t      let k, kase;\n\t      for (k = p - 2; k >= -1; k--) {\n\t        if (k === -1) {\n\t          break;\n\t        }\n\t        const alpha =\n\t          Number.MIN_VALUE + eps * Math.abs(s[k] + Math.abs(s[k + 1]));\n\t        if (Math.abs(e[k]) <= alpha || Number.isNaN(e[k])) {\n\t          e[k] = 0;\n\t          break;\n\t        }\n\t      }\n\t      if (k === p - 2) {\n\t        kase = 4;\n\t      } else {\n\t        let ks;\n\t        for (ks = p - 1; ks >= k; ks--) {\n\t          if (ks === k) {\n\t            break;\n\t          }\n\t          let t =\n\t            (ks !== p ? Math.abs(e[ks]) : 0) +\n\t            (ks !== k + 1 ? Math.abs(e[ks - 1]) : 0);\n\t          if (Math.abs(s[ks]) <= eps * t) {\n\t            s[ks] = 0;\n\t            break;\n\t          }\n\t        }\n\t        if (ks === k) {\n\t          kase = 3;\n\t        } else if (ks === p - 1) {\n\t          kase = 1;\n\t        } else {\n\t          kase = 2;\n\t          k = ks;\n\t        }\n\t      }\n\n\t      k++;\n\n\t      switch (kase) {\n\t        case 1: {\n\t          let f = e[p - 2];\n\t          e[p - 2] = 0;\n\t          for (let j = p - 2; j >= k; j--) {\n\t            let t = hypotenuse(s[j], f);\n\t            let cs = s[j] / t;\n\t            let sn = f / t;\n\t            s[j] = t;\n\t            if (j !== k) {\n\t              f = -sn * e[j - 1];\n\t              e[j - 1] = cs * e[j - 1];\n\t            }\n\t            if (wantv) {\n\t              for (let i = 0; i < n; i++) {\n\t                t = cs * V.get(i, j) + sn * V.get(i, p - 1);\n\t                V.set(i, p - 1, -sn * V.get(i, j) + cs * V.get(i, p - 1));\n\t                V.set(i, j, t);\n\t              }\n\t            }\n\t          }\n\t          break;\n\t        }\n\t        case 2: {\n\t          let f = e[k - 1];\n\t          e[k - 1] = 0;\n\t          for (let j = k; j < p; j++) {\n\t            let t = hypotenuse(s[j], f);\n\t            let cs = s[j] / t;\n\t            let sn = f / t;\n\t            s[j] = t;\n\t            f = -sn * e[j];\n\t            e[j] = cs * e[j];\n\t            if (wantu) {\n\t              for (let i = 0; i < m; i++) {\n\t                t = cs * U.get(i, j) + sn * U.get(i, k - 1);\n\t                U.set(i, k - 1, -sn * U.get(i, j) + cs * U.get(i, k - 1));\n\t                U.set(i, j, t);\n\t              }\n\t            }\n\t          }\n\t          break;\n\t        }\n\t        case 3: {\n\t          const scale = Math.max(\n\t            Math.abs(s[p - 1]),\n\t            Math.abs(s[p - 2]),\n\t            Math.abs(e[p - 2]),\n\t            Math.abs(s[k]),\n\t            Math.abs(e[k]),\n\t          );\n\t          const sp = s[p - 1] / scale;\n\t          const spm1 = s[p - 2] / scale;\n\t          const epm1 = e[p - 2] / scale;\n\t          const sk = s[k] / scale;\n\t          const ek = e[k] / scale;\n\t          const b = ((spm1 + sp) * (spm1 - sp) + epm1 * epm1) / 2;\n\t          const c = sp * epm1 * (sp * epm1);\n\t          let shift = 0;\n\t          if (b !== 0 || c !== 0) {\n\t            if (b < 0) {\n\t              shift = 0 - Math.sqrt(b * b + c);\n\t            } else {\n\t              shift = Math.sqrt(b * b + c);\n\t            }\n\t            shift = c / (b + shift);\n\t          }\n\t          let f = (sk + sp) * (sk - sp) + shift;\n\t          let g = sk * ek;\n\t          for (let j = k; j < p - 1; j++) {\n\t            let t = hypotenuse(f, g);\n\t            if (t === 0) t = Number.MIN_VALUE;\n\t            let cs = f / t;\n\t            let sn = g / t;\n\t            if (j !== k) {\n\t              e[j - 1] = t;\n\t            }\n\t            f = cs * s[j] + sn * e[j];\n\t            e[j] = cs * e[j] - sn * s[j];\n\t            g = sn * s[j + 1];\n\t            s[j + 1] = cs * s[j + 1];\n\t            if (wantv) {\n\t              for (let i = 0; i < n; i++) {\n\t                t = cs * V.get(i, j) + sn * V.get(i, j + 1);\n\t                V.set(i, j + 1, -sn * V.get(i, j) + cs * V.get(i, j + 1));\n\t                V.set(i, j, t);\n\t              }\n\t            }\n\t            t = hypotenuse(f, g);\n\t            if (t === 0) t = Number.MIN_VALUE;\n\t            cs = f / t;\n\t            sn = g / t;\n\t            s[j] = t;\n\t            f = cs * e[j] + sn * s[j + 1];\n\t            s[j + 1] = -sn * e[j] + cs * s[j + 1];\n\t            g = sn * e[j + 1];\n\t            e[j + 1] = cs * e[j + 1];\n\t            if (wantu && j < m - 1) {\n\t              for (let i = 0; i < m; i++) {\n\t                t = cs * U.get(i, j) + sn * U.get(i, j + 1);\n\t                U.set(i, j + 1, -sn * U.get(i, j) + cs * U.get(i, j + 1));\n\t                U.set(i, j, t);\n\t              }\n\t            }\n\t          }\n\t          e[p - 2] = f;\n\t          break;\n\t        }\n\t        case 4: {\n\t          if (s[k] <= 0) {\n\t            s[k] = s[k] < 0 ? -s[k] : 0;\n\t            if (wantv) {\n\t              for (let i = 0; i <= pp; i++) {\n\t                V.set(i, k, -V.get(i, k));\n\t              }\n\t            }\n\t          }\n\t          while (k < pp) {\n\t            if (s[k] >= s[k + 1]) {\n\t              break;\n\t            }\n\t            let t = s[k];\n\t            s[k] = s[k + 1];\n\t            s[k + 1] = t;\n\t            if (wantv && k < n - 1) {\n\t              for (let i = 0; i < n; i++) {\n\t                t = V.get(i, k + 1);\n\t                V.set(i, k + 1, V.get(i, k));\n\t                V.set(i, k, t);\n\t              }\n\t            }\n\t            if (wantu && k < m - 1) {\n\t              for (let i = 0; i < m; i++) {\n\t                t = U.get(i, k + 1);\n\t                U.set(i, k + 1, U.get(i, k));\n\t                U.set(i, k, t);\n\t              }\n\t            }\n\t            k++;\n\t          }\n\t          p--;\n\t          break;\n\t        }\n\t        // no default\n\t      }\n\t    }\n\n\t    if (swapped) {\n\t      let tmp = V;\n\t      V = U;\n\t      U = tmp;\n\t    }\n\n\t    this.m = m;\n\t    this.n = n;\n\t    this.s = s;\n\t    this.U = U;\n\t    this.V = V;\n\t  }\n\n\t  solve(value) {\n\t    let Y = value;\n\t    let e = this.threshold;\n\t    let scols = this.s.length;\n\t    let Ls = Matrix.zeros(scols, scols);\n\n\t    for (let i = 0; i < scols; i++) {\n\t      if (Math.abs(this.s[i]) <= e) {\n\t        Ls.set(i, i, 0);\n\t      } else {\n\t        Ls.set(i, i, 1 / this.s[i]);\n\t      }\n\t    }\n\n\t    let U = this.U;\n\t    let V = this.rightSingularVectors;\n\n\t    let VL = V.mmul(Ls);\n\t    let vrows = V.rows;\n\t    let urows = U.rows;\n\t    let VLU = Matrix.zeros(vrows, urows);\n\n\t    for (let i = 0; i < vrows; i++) {\n\t      for (let j = 0; j < urows; j++) {\n\t        let sum = 0;\n\t        for (let k = 0; k < scols; k++) {\n\t          sum += VL.get(i, k) * U.get(j, k);\n\t        }\n\t        VLU.set(i, j, sum);\n\t      }\n\t    }\n\n\t    return VLU.mmul(Y);\n\t  }\n\n\t  solveForDiagonal(value) {\n\t    return this.solve(Matrix.diag(value));\n\t  }\n\n\t  inverse() {\n\t    let V = this.V;\n\t    let e = this.threshold;\n\t    let vrows = V.rows;\n\t    let vcols = V.columns;\n\t    let X = new Matrix(vrows, this.s.length);\n\n\t    for (let i = 0; i < vrows; i++) {\n\t      for (let j = 0; j < vcols; j++) {\n\t        if (Math.abs(this.s[j]) > e) {\n\t          X.set(i, j, V.get(i, j) / this.s[j]);\n\t        }\n\t      }\n\t    }\n\n\t    let U = this.U;\n\n\t    let urows = U.rows;\n\t    let ucols = U.columns;\n\t    let Y = new Matrix(vrows, urows);\n\n\t    for (let i = 0; i < vrows; i++) {\n\t      for (let j = 0; j < urows; j++) {\n\t        let sum = 0;\n\t        for (let k = 0; k < ucols; k++) {\n\t          sum += X.get(i, k) * U.get(j, k);\n\t        }\n\t        Y.set(i, j, sum);\n\t      }\n\t    }\n\n\t    return Y;\n\t  }\n\n\t  get condition() {\n\t    return this.s[0] / this.s[Math.min(this.m, this.n) - 1];\n\t  }\n\n\t  get norm2() {\n\t    return this.s[0];\n\t  }\n\n\t  get rank() {\n\t    let tol = Math.max(this.m, this.n) * this.s[0] * Number.EPSILON;\n\t    let r = 0;\n\t    let s = this.s;\n\t    for (let i = 0, ii = s.length; i < ii; i++) {\n\t      if (s[i] > tol) {\n\t        r++;\n\t      }\n\t    }\n\t    return r;\n\t  }\n\n\t  get diagonal() {\n\t    return Array.from(this.s);\n\t  }\n\n\t  get threshold() {\n\t    return (Number.EPSILON / 2) * Math.max(this.m, this.n) * this.s[0];\n\t  }\n\n\t  get leftSingularVectors() {\n\t    return this.U;\n\t  }\n\n\t  get rightSingularVectors() {\n\t    return this.V;\n\t  }\n\n\t  get diagonalMatrix() {\n\t    return Matrix.diag(this.s);\n\t  }\n\t}\n\n\tfunction inverse(matrix, useSVD = false) {\n\t  matrix = WrapperMatrix2D.checkMatrix(matrix);\n\t  if (useSVD) {\n\t    return new SingularValueDecomposition(matrix).inverse();\n\t  } else {\n\t    return solve(matrix, Matrix.eye(matrix.rows));\n\t  }\n\t}\n\n\tfunction solve(leftHandSide, rightHandSide, useSVD = false) {\n\t  leftHandSide = WrapperMatrix2D.checkMatrix(leftHandSide);\n\t  rightHandSide = WrapperMatrix2D.checkMatrix(rightHandSide);\n\t  if (useSVD) {\n\t    return new SingularValueDecomposition(leftHandSide).solve(rightHandSide);\n\t  } else {\n\t    return leftHandSide.isSquare()\n\t      ? new LuDecomposition(leftHandSide).solve(rightHandSide)\n\t      : new QrDecomposition(leftHandSide).solve(rightHandSide);\n\t  }\n\t}\n\n\tfunction determinant(matrix) {\n\t  matrix = Matrix.checkMatrix(matrix);\n\t  if (matrix.isSquare()) {\n\t    if (matrix.columns === 0) {\n\t      return 1;\n\t    }\n\n\t    let a, b, c, d;\n\t    if (matrix.columns === 2) {\n\t      // 2 x 2 matrix\n\t      a = matrix.get(0, 0);\n\t      b = matrix.get(0, 1);\n\t      c = matrix.get(1, 0);\n\t      d = matrix.get(1, 1);\n\n\t      return a * d - b * c;\n\t    } else if (matrix.columns === 3) {\n\t      // 3 x 3 matrix\n\t      let subMatrix0, subMatrix1, subMatrix2;\n\t      subMatrix0 = new MatrixSelectionView(matrix, [1, 2], [1, 2]);\n\t      subMatrix1 = new MatrixSelectionView(matrix, [1, 2], [0, 2]);\n\t      subMatrix2 = new MatrixSelectionView(matrix, [1, 2], [0, 1]);\n\t      a = matrix.get(0, 0);\n\t      b = matrix.get(0, 1);\n\t      c = matrix.get(0, 2);\n\n\t      return (\n\t        a * determinant(subMatrix0) -\n\t        b * determinant(subMatrix1) +\n\t        c * determinant(subMatrix2)\n\t      );\n\t    } else {\n\t      // general purpose determinant using the LU decomposition\n\t      return new LuDecomposition(matrix).determinant;\n\t    }\n\t  } else {\n\t    throw Error('determinant can only be calculated for a square matrix');\n\t  }\n\t}\n\n\tfunction xrange(n, exception) {\n\t  let range = [];\n\t  for (let i = 0; i < n; i++) {\n\t    if (i !== exception) {\n\t      range.push(i);\n\t    }\n\t  }\n\t  return range;\n\t}\n\n\tfunction dependenciesOneRow(\n\t  error,\n\t  matrix,\n\t  index,\n\t  thresholdValue = 10e-10,\n\t  thresholdError = 10e-10,\n\t) {\n\t  if (error > thresholdError) {\n\t    return new Array(matrix.rows + 1).fill(0);\n\t  } else {\n\t    let returnArray = matrix.addRow(index, [0]);\n\t    for (let i = 0; i < returnArray.rows; i++) {\n\t      if (Math.abs(returnArray.get(i, 0)) < thresholdValue) {\n\t        returnArray.set(i, 0, 0);\n\t      }\n\t    }\n\t    return returnArray.to1DArray();\n\t  }\n\t}\n\n\tfunction linearDependencies(matrix, options = {}) {\n\t  const { thresholdValue = 10e-10, thresholdError = 10e-10 } = options;\n\t  matrix = Matrix.checkMatrix(matrix);\n\n\t  let n = matrix.rows;\n\t  let results = new Matrix(n, n);\n\n\t  for (let i = 0; i < n; i++) {\n\t    let b = Matrix.columnVector(matrix.getRow(i));\n\t    let Abis = matrix.subMatrixRow(xrange(n, i)).transpose();\n\t    let svd = new SingularValueDecomposition(Abis);\n\t    let x = svd.solve(b);\n\t    let error = Matrix.sub(b, Abis.mmul(x)).abs().max();\n\t    results.setRow(\n\t      i,\n\t      dependenciesOneRow(error, x, i, thresholdValue, thresholdError),\n\t    );\n\t  }\n\t  return results;\n\t}\n\n\tfunction pseudoInverse(matrix, threshold = Number.EPSILON) {\n\t  matrix = Matrix.checkMatrix(matrix);\n\t  if (matrix.isEmpty()) {\n\t    // with a zero dimension, the pseudo-inverse is the transpose, since all 0xn and nx0 matrices are singular\n\t    // (0xn)*(nx0)*(0xn) = 0xn\n\t    // (nx0)*(0xn)*(nx0) = nx0\n\t    return matrix.transpose();\n\t  }\n\t  let svdSolution = new SingularValueDecomposition(matrix, { autoTranspose: true });\n\n\t  let U = svdSolution.leftSingularVectors;\n\t  let V = svdSolution.rightSingularVectors;\n\t  let s = svdSolution.diagonal;\n\n\t  for (let i = 0; i < s.length; i++) {\n\t    if (Math.abs(s[i]) > threshold) {\n\t      s[i] = 1.0 / s[i];\n\t    } else {\n\t      s[i] = 0.0;\n\t    }\n\t  }\n\n\t  return V.mmul(Matrix.diag(s).mmul(U.transpose()));\n\t}\n\n\tfunction covariance(xMatrix, yMatrix = xMatrix, options = {}) {\n\t  xMatrix = new Matrix(xMatrix);\n\t  let yIsSame = false;\n\t  if (\n\t    typeof yMatrix === 'object' &&\n\t    !Matrix.isMatrix(yMatrix) &&\n\t    !isAnyArray.isAnyArray(yMatrix)\n\t  ) {\n\t    options = yMatrix;\n\t    yMatrix = xMatrix;\n\t    yIsSame = true;\n\t  } else {\n\t    yMatrix = new Matrix(yMatrix);\n\t  }\n\t  if (xMatrix.rows !== yMatrix.rows) {\n\t    throw new TypeError('Both matrices must have the same number of rows');\n\t  }\n\t  const { center = true } = options;\n\t  if (center) {\n\t    xMatrix = xMatrix.center('column');\n\t    if (!yIsSame) {\n\t      yMatrix = yMatrix.center('column');\n\t    }\n\t  }\n\t  const cov = xMatrix.transpose().mmul(yMatrix);\n\t  for (let i = 0; i < cov.rows; i++) {\n\t    for (let j = 0; j < cov.columns; j++) {\n\t      cov.set(i, j, cov.get(i, j) * (1 / (xMatrix.rows - 1)));\n\t    }\n\t  }\n\t  return cov;\n\t}\n\n\tfunction correlation(xMatrix, yMatrix = xMatrix, options = {}) {\n\t  xMatrix = new Matrix(xMatrix);\n\t  let yIsSame = false;\n\t  if (\n\t    typeof yMatrix === 'object' &&\n\t    !Matrix.isMatrix(yMatrix) &&\n\t    !isAnyArray.isAnyArray(yMatrix)\n\t  ) {\n\t    options = yMatrix;\n\t    yMatrix = xMatrix;\n\t    yIsSame = true;\n\t  } else {\n\t    yMatrix = new Matrix(yMatrix);\n\t  }\n\t  if (xMatrix.rows !== yMatrix.rows) {\n\t    throw new TypeError('Both matrices must have the same number of rows');\n\t  }\n\n\t  const { center = true, scale = true } = options;\n\t  if (center) {\n\t    xMatrix.center('column');\n\t    if (!yIsSame) {\n\t      yMatrix.center('column');\n\t    }\n\t  }\n\t  if (scale) {\n\t    xMatrix.scale('column');\n\t    if (!yIsSame) {\n\t      yMatrix.scale('column');\n\t    }\n\t  }\n\n\t  const sdx = xMatrix.standardDeviation('column', { unbiased: true });\n\t  const sdy = yIsSame\n\t    ? sdx\n\t    : yMatrix.standardDeviation('column', { unbiased: true });\n\n\t  const corr = xMatrix.transpose().mmul(yMatrix);\n\t  for (let i = 0; i < corr.rows; i++) {\n\t    for (let j = 0; j < corr.columns; j++) {\n\t      corr.set(\n\t        i,\n\t        j,\n\t        corr.get(i, j) * (1 / (sdx[i] * sdy[j])) * (1 / (xMatrix.rows - 1)),\n\t      );\n\t    }\n\t  }\n\t  return corr;\n\t}\n\n\tclass EigenvalueDecomposition {\n\t  constructor(matrix, options = {}) {\n\t    const { assumeSymmetric = false } = options;\n\n\t    matrix = WrapperMatrix2D.checkMatrix(matrix);\n\t    if (!matrix.isSquare()) {\n\t      throw new Error('Matrix is not a square matrix');\n\t    }\n\n\t    if (matrix.isEmpty()) {\n\t      throw new Error('Matrix must be non-empty');\n\t    }\n\n\t    let n = matrix.columns;\n\t    let V = new Matrix(n, n);\n\t    let d = new Float64Array(n);\n\t    let e = new Float64Array(n);\n\t    let value = matrix;\n\t    let i, j;\n\n\t    let isSymmetric = false;\n\t    if (assumeSymmetric) {\n\t      isSymmetric = true;\n\t    } else {\n\t      isSymmetric = matrix.isSymmetric();\n\t    }\n\n\t    if (isSymmetric) {\n\t      for (i = 0; i < n; i++) {\n\t        for (j = 0; j < n; j++) {\n\t          V.set(i, j, value.get(i, j));\n\t        }\n\t      }\n\t      tred2(n, e, d, V);\n\t      tql2(n, e, d, V);\n\t    } else {\n\t      let H = new Matrix(n, n);\n\t      let ort = new Float64Array(n);\n\t      for (j = 0; j < n; j++) {\n\t        for (i = 0; i < n; i++) {\n\t          H.set(i, j, value.get(i, j));\n\t        }\n\t      }\n\t      orthes(n, H, ort, V);\n\t      hqr2(n, e, d, V, H);\n\t    }\n\n\t    this.n = n;\n\t    this.e = e;\n\t    this.d = d;\n\t    this.V = V;\n\t  }\n\n\t  get realEigenvalues() {\n\t    return Array.from(this.d);\n\t  }\n\n\t  get imaginaryEigenvalues() {\n\t    return Array.from(this.e);\n\t  }\n\n\t  get eigenvectorMatrix() {\n\t    return this.V;\n\t  }\n\n\t  get diagonalMatrix() {\n\t    let n = this.n;\n\t    let e = this.e;\n\t    let d = this.d;\n\t    let X = new Matrix(n, n);\n\t    let i, j;\n\t    for (i = 0; i < n; i++) {\n\t      for (j = 0; j < n; j++) {\n\t        X.set(i, j, 0);\n\t      }\n\t      X.set(i, i, d[i]);\n\t      if (e[i] > 0) {\n\t        X.set(i, i + 1, e[i]);\n\t      } else if (e[i] < 0) {\n\t        X.set(i, i - 1, e[i]);\n\t      }\n\t    }\n\t    return X;\n\t  }\n\t}\n\n\tfunction tred2(n, e, d, V) {\n\t  let f, g, h, i, j, k, hh, scale;\n\n\t  for (j = 0; j < n; j++) {\n\t    d[j] = V.get(n - 1, j);\n\t  }\n\n\t  for (i = n - 1; i > 0; i--) {\n\t    scale = 0;\n\t    h = 0;\n\t    for (k = 0; k < i; k++) {\n\t      scale = scale + Math.abs(d[k]);\n\t    }\n\n\t    if (scale === 0) {\n\t      e[i] = d[i - 1];\n\t      for (j = 0; j < i; j++) {\n\t        d[j] = V.get(i - 1, j);\n\t        V.set(i, j, 0);\n\t        V.set(j, i, 0);\n\t      }\n\t    } else {\n\t      for (k = 0; k < i; k++) {\n\t        d[k] /= scale;\n\t        h += d[k] * d[k];\n\t      }\n\n\t      f = d[i - 1];\n\t      g = Math.sqrt(h);\n\t      if (f > 0) {\n\t        g = -g;\n\t      }\n\n\t      e[i] = scale * g;\n\t      h = h - f * g;\n\t      d[i - 1] = f - g;\n\t      for (j = 0; j < i; j++) {\n\t        e[j] = 0;\n\t      }\n\n\t      for (j = 0; j < i; j++) {\n\t        f = d[j];\n\t        V.set(j, i, f);\n\t        g = e[j] + V.get(j, j) * f;\n\t        for (k = j + 1; k <= i - 1; k++) {\n\t          g += V.get(k, j) * d[k];\n\t          e[k] += V.get(k, j) * f;\n\t        }\n\t        e[j] = g;\n\t      }\n\n\t      f = 0;\n\t      for (j = 0; j < i; j++) {\n\t        e[j] /= h;\n\t        f += e[j] * d[j];\n\t      }\n\n\t      hh = f / (h + h);\n\t      for (j = 0; j < i; j++) {\n\t        e[j] -= hh * d[j];\n\t      }\n\n\t      for (j = 0; j < i; j++) {\n\t        f = d[j];\n\t        g = e[j];\n\t        for (k = j; k <= i - 1; k++) {\n\t          V.set(k, j, V.get(k, j) - (f * e[k] + g * d[k]));\n\t        }\n\t        d[j] = V.get(i - 1, j);\n\t        V.set(i, j, 0);\n\t      }\n\t    }\n\t    d[i] = h;\n\t  }\n\n\t  for (i = 0; i < n - 1; i++) {\n\t    V.set(n - 1, i, V.get(i, i));\n\t    V.set(i, i, 1);\n\t    h = d[i + 1];\n\t    if (h !== 0) {\n\t      for (k = 0; k <= i; k++) {\n\t        d[k] = V.get(k, i + 1) / h;\n\t      }\n\n\t      for (j = 0; j <= i; j++) {\n\t        g = 0;\n\t        for (k = 0; k <= i; k++) {\n\t          g += V.get(k, i + 1) * V.get(k, j);\n\t        }\n\t        for (k = 0; k <= i; k++) {\n\t          V.set(k, j, V.get(k, j) - g * d[k]);\n\t        }\n\t      }\n\t    }\n\n\t    for (k = 0; k <= i; k++) {\n\t      V.set(k, i + 1, 0);\n\t    }\n\t  }\n\n\t  for (j = 0; j < n; j++) {\n\t    d[j] = V.get(n - 1, j);\n\t    V.set(n - 1, j, 0);\n\t  }\n\n\t  V.set(n - 1, n - 1, 1);\n\t  e[0] = 0;\n\t}\n\n\tfunction tql2(n, e, d, V) {\n\t  let g, h, i, j, k, l, m, p, r, dl1, c, c2, c3, el1, s, s2;\n\n\t  for (i = 1; i < n; i++) {\n\t    e[i - 1] = e[i];\n\t  }\n\n\t  e[n - 1] = 0;\n\n\t  let f = 0;\n\t  let tst1 = 0;\n\t  let eps = Number.EPSILON;\n\n\t  for (l = 0; l < n; l++) {\n\t    tst1 = Math.max(tst1, Math.abs(d[l]) + Math.abs(e[l]));\n\t    m = l;\n\t    while (m < n) {\n\t      if (Math.abs(e[m]) <= eps * tst1) {\n\t        break;\n\t      }\n\t      m++;\n\t    }\n\n\t    if (m > l) {\n\t      do {\n\n\t        g = d[l];\n\t        p = (d[l + 1] - g) / (2 * e[l]);\n\t        r = hypotenuse(p, 1);\n\t        if (p < 0) {\n\t          r = -r;\n\t        }\n\n\t        d[l] = e[l] / (p + r);\n\t        d[l + 1] = e[l] * (p + r);\n\t        dl1 = d[l + 1];\n\t        h = g - d[l];\n\t        for (i = l + 2; i < n; i++) {\n\t          d[i] -= h;\n\t        }\n\n\t        f = f + h;\n\n\t        p = d[m];\n\t        c = 1;\n\t        c2 = c;\n\t        c3 = c;\n\t        el1 = e[l + 1];\n\t        s = 0;\n\t        s2 = 0;\n\t        for (i = m - 1; i >= l; i--) {\n\t          c3 = c2;\n\t          c2 = c;\n\t          s2 = s;\n\t          g = c * e[i];\n\t          h = c * p;\n\t          r = hypotenuse(p, e[i]);\n\t          e[i + 1] = s * r;\n\t          s = e[i] / r;\n\t          c = p / r;\n\t          p = c * d[i] - s * g;\n\t          d[i + 1] = h + s * (c * g + s * d[i]);\n\n\t          for (k = 0; k < n; k++) {\n\t            h = V.get(k, i + 1);\n\t            V.set(k, i + 1, s * V.get(k, i) + c * h);\n\t            V.set(k, i, c * V.get(k, i) - s * h);\n\t          }\n\t        }\n\n\t        p = (-s * s2 * c3 * el1 * e[l]) / dl1;\n\t        e[l] = s * p;\n\t        d[l] = c * p;\n\t      } while (Math.abs(e[l]) > eps * tst1);\n\t    }\n\t    d[l] = d[l] + f;\n\t    e[l] = 0;\n\t  }\n\n\t  for (i = 0; i < n - 1; i++) {\n\t    k = i;\n\t    p = d[i];\n\t    for (j = i + 1; j < n; j++) {\n\t      if (d[j] < p) {\n\t        k = j;\n\t        p = d[j];\n\t      }\n\t    }\n\n\t    if (k !== i) {\n\t      d[k] = d[i];\n\t      d[i] = p;\n\t      for (j = 0; j < n; j++) {\n\t        p = V.get(j, i);\n\t        V.set(j, i, V.get(j, k));\n\t        V.set(j, k, p);\n\t      }\n\t    }\n\t  }\n\t}\n\n\tfunction orthes(n, H, ort, V) {\n\t  let low = 0;\n\t  let high = n - 1;\n\t  let f, g, h, i, j, m;\n\t  let scale;\n\n\t  for (m = low + 1; m <= high - 1; m++) {\n\t    scale = 0;\n\t    for (i = m; i <= high; i++) {\n\t      scale = scale + Math.abs(H.get(i, m - 1));\n\t    }\n\n\t    if (scale !== 0) {\n\t      h = 0;\n\t      for (i = high; i >= m; i--) {\n\t        ort[i] = H.get(i, m - 1) / scale;\n\t        h += ort[i] * ort[i];\n\t      }\n\n\t      g = Math.sqrt(h);\n\t      if (ort[m] > 0) {\n\t        g = -g;\n\t      }\n\n\t      h = h - ort[m] * g;\n\t      ort[m] = ort[m] - g;\n\n\t      for (j = m; j < n; j++) {\n\t        f = 0;\n\t        for (i = high; i >= m; i--) {\n\t          f += ort[i] * H.get(i, j);\n\t        }\n\n\t        f = f / h;\n\t        for (i = m; i <= high; i++) {\n\t          H.set(i, j, H.get(i, j) - f * ort[i]);\n\t        }\n\t      }\n\n\t      for (i = 0; i <= high; i++) {\n\t        f = 0;\n\t        for (j = high; j >= m; j--) {\n\t          f += ort[j] * H.get(i, j);\n\t        }\n\n\t        f = f / h;\n\t        for (j = m; j <= high; j++) {\n\t          H.set(i, j, H.get(i, j) - f * ort[j]);\n\t        }\n\t      }\n\n\t      ort[m] = scale * ort[m];\n\t      H.set(m, m - 1, scale * g);\n\t    }\n\t  }\n\n\t  for (i = 0; i < n; i++) {\n\t    for (j = 0; j < n; j++) {\n\t      V.set(i, j, i === j ? 1 : 0);\n\t    }\n\t  }\n\n\t  for (m = high - 1; m >= low + 1; m--) {\n\t    if (H.get(m, m - 1) !== 0) {\n\t      for (i = m + 1; i <= high; i++) {\n\t        ort[i] = H.get(i, m - 1);\n\t      }\n\n\t      for (j = m; j <= high; j++) {\n\t        g = 0;\n\t        for (i = m; i <= high; i++) {\n\t          g += ort[i] * V.get(i, j);\n\t        }\n\n\t        g = g / ort[m] / H.get(m, m - 1);\n\t        for (i = m; i <= high; i++) {\n\t          V.set(i, j, V.get(i, j) + g * ort[i]);\n\t        }\n\t      }\n\t    }\n\t  }\n\t}\n\n\tfunction hqr2(nn, e, d, V, H) {\n\t  let n = nn - 1;\n\t  let low = 0;\n\t  let high = nn - 1;\n\t  let eps = Number.EPSILON;\n\t  let exshift = 0;\n\t  let norm = 0;\n\t  let p = 0;\n\t  let q = 0;\n\t  let r = 0;\n\t  let s = 0;\n\t  let z = 0;\n\t  let iter = 0;\n\t  let i, j, k, l, m, t, w, x, y;\n\t  let ra, sa, vr, vi;\n\t  let notlast, cdivres;\n\n\t  for (i = 0; i < nn; i++) {\n\t    if (i < low || i > high) {\n\t      d[i] = H.get(i, i);\n\t      e[i] = 0;\n\t    }\n\n\t    for (j = Math.max(i - 1, 0); j < nn; j++) {\n\t      norm = norm + Math.abs(H.get(i, j));\n\t    }\n\t  }\n\n\t  while (n >= low) {\n\t    l = n;\n\t    while (l > low) {\n\t      s = Math.abs(H.get(l - 1, l - 1)) + Math.abs(H.get(l, l));\n\t      if (s === 0) {\n\t        s = norm;\n\t      }\n\t      if (Math.abs(H.get(l, l - 1)) < eps * s) {\n\t        break;\n\t      }\n\t      l--;\n\t    }\n\n\t    if (l === n) {\n\t      H.set(n, n, H.get(n, n) + exshift);\n\t      d[n] = H.get(n, n);\n\t      e[n] = 0;\n\t      n--;\n\t      iter = 0;\n\t    } else if (l === n - 1) {\n\t      w = H.get(n, n - 1) * H.get(n - 1, n);\n\t      p = (H.get(n - 1, n - 1) - H.get(n, n)) / 2;\n\t      q = p * p + w;\n\t      z = Math.sqrt(Math.abs(q));\n\t      H.set(n, n, H.get(n, n) + exshift);\n\t      H.set(n - 1, n - 1, H.get(n - 1, n - 1) + exshift);\n\t      x = H.get(n, n);\n\n\t      if (q >= 0) {\n\t        z = p >= 0 ? p + z : p - z;\n\t        d[n - 1] = x + z;\n\t        d[n] = d[n - 1];\n\t        if (z !== 0) {\n\t          d[n] = x - w / z;\n\t        }\n\t        e[n - 1] = 0;\n\t        e[n] = 0;\n\t        x = H.get(n, n - 1);\n\t        s = Math.abs(x) + Math.abs(z);\n\t        p = x / s;\n\t        q = z / s;\n\t        r = Math.sqrt(p * p + q * q);\n\t        p = p / r;\n\t        q = q / r;\n\n\t        for (j = n - 1; j < nn; j++) {\n\t          z = H.get(n - 1, j);\n\t          H.set(n - 1, j, q * z + p * H.get(n, j));\n\t          H.set(n, j, q * H.get(n, j) - p * z);\n\t        }\n\n\t        for (i = 0; i <= n; i++) {\n\t          z = H.get(i, n - 1);\n\t          H.set(i, n - 1, q * z + p * H.get(i, n));\n\t          H.set(i, n, q * H.get(i, n) - p * z);\n\t        }\n\n\t        for (i = low; i <= high; i++) {\n\t          z = V.get(i, n - 1);\n\t          V.set(i, n - 1, q * z + p * V.get(i, n));\n\t          V.set(i, n, q * V.get(i, n) - p * z);\n\t        }\n\t      } else {\n\t        d[n - 1] = x + p;\n\t        d[n] = x + p;\n\t        e[n - 1] = z;\n\t        e[n] = -z;\n\t      }\n\n\t      n = n - 2;\n\t      iter = 0;\n\t    } else {\n\t      x = H.get(n, n);\n\t      y = 0;\n\t      w = 0;\n\t      if (l < n) {\n\t        y = H.get(n - 1, n - 1);\n\t        w = H.get(n, n - 1) * H.get(n - 1, n);\n\t      }\n\n\t      if (iter === 10) {\n\t        exshift += x;\n\t        for (i = low; i <= n; i++) {\n\t          H.set(i, i, H.get(i, i) - x);\n\t        }\n\t        s = Math.abs(H.get(n, n - 1)) + Math.abs(H.get(n - 1, n - 2));\n\t        // eslint-disable-next-line no-multi-assign\n\t        x = y = 0.75 * s;\n\t        w = -0.4375 * s * s;\n\t      }\n\n\t      if (iter === 30) {\n\t        s = (y - x) / 2;\n\t        s = s * s + w;\n\t        if (s > 0) {\n\t          s = Math.sqrt(s);\n\t          if (y < x) {\n\t            s = -s;\n\t          }\n\t          s = x - w / ((y - x) / 2 + s);\n\t          for (i = low; i <= n; i++) {\n\t            H.set(i, i, H.get(i, i) - s);\n\t          }\n\t          exshift += s;\n\t          // eslint-disable-next-line no-multi-assign\n\t          x = y = w = 0.964;\n\t        }\n\t      }\n\n\t      iter = iter + 1;\n\n\t      m = n - 2;\n\t      while (m >= l) {\n\t        z = H.get(m, m);\n\t        r = x - z;\n\t        s = y - z;\n\t        p = (r * s - w) / H.get(m + 1, m) + H.get(m, m + 1);\n\t        q = H.get(m + 1, m + 1) - z - r - s;\n\t        r = H.get(m + 2, m + 1);\n\t        s = Math.abs(p) + Math.abs(q) + Math.abs(r);\n\t        p = p / s;\n\t        q = q / s;\n\t        r = r / s;\n\t        if (m === l) {\n\t          break;\n\t        }\n\t        if (\n\t          Math.abs(H.get(m, m - 1)) * (Math.abs(q) + Math.abs(r)) <\n\t          eps *\n\t            (Math.abs(p) *\n\t              (Math.abs(H.get(m - 1, m - 1)) +\n\t                Math.abs(z) +\n\t                Math.abs(H.get(m + 1, m + 1))))\n\t        ) {\n\t          break;\n\t        }\n\t        m--;\n\t      }\n\n\t      for (i = m + 2; i <= n; i++) {\n\t        H.set(i, i - 2, 0);\n\t        if (i > m + 2) {\n\t          H.set(i, i - 3, 0);\n\t        }\n\t      }\n\n\t      for (k = m; k <= n - 1; k++) {\n\t        notlast = k !== n - 1;\n\t        if (k !== m) {\n\t          p = H.get(k, k - 1);\n\t          q = H.get(k + 1, k - 1);\n\t          r = notlast ? H.get(k + 2, k - 1) : 0;\n\t          x = Math.abs(p) + Math.abs(q) + Math.abs(r);\n\t          if (x !== 0) {\n\t            p = p / x;\n\t            q = q / x;\n\t            r = r / x;\n\t          }\n\t        }\n\n\t        if (x === 0) {\n\t          break;\n\t        }\n\n\t        s = Math.sqrt(p * p + q * q + r * r);\n\t        if (p < 0) {\n\t          s = -s;\n\t        }\n\n\t        if (s !== 0) {\n\t          if (k !== m) {\n\t            H.set(k, k - 1, -s * x);\n\t          } else if (l !== m) {\n\t            H.set(k, k - 1, -H.get(k, k - 1));\n\t          }\n\n\t          p = p + s;\n\t          x = p / s;\n\t          y = q / s;\n\t          z = r / s;\n\t          q = q / p;\n\t          r = r / p;\n\n\t          for (j = k; j < nn; j++) {\n\t            p = H.get(k, j) + q * H.get(k + 1, j);\n\t            if (notlast) {\n\t              p = p + r * H.get(k + 2, j);\n\t              H.set(k + 2, j, H.get(k + 2, j) - p * z);\n\t            }\n\n\t            H.set(k, j, H.get(k, j) - p * x);\n\t            H.set(k + 1, j, H.get(k + 1, j) - p * y);\n\t          }\n\n\t          for (i = 0; i <= Math.min(n, k + 3); i++) {\n\t            p = x * H.get(i, k) + y * H.get(i, k + 1);\n\t            if (notlast) {\n\t              p = p + z * H.get(i, k + 2);\n\t              H.set(i, k + 2, H.get(i, k + 2) - p * r);\n\t            }\n\n\t            H.set(i, k, H.get(i, k) - p);\n\t            H.set(i, k + 1, H.get(i, k + 1) - p * q);\n\t          }\n\n\t          for (i = low; i <= high; i++) {\n\t            p = x * V.get(i, k) + y * V.get(i, k + 1);\n\t            if (notlast) {\n\t              p = p + z * V.get(i, k + 2);\n\t              V.set(i, k + 2, V.get(i, k + 2) - p * r);\n\t            }\n\n\t            V.set(i, k, V.get(i, k) - p);\n\t            V.set(i, k + 1, V.get(i, k + 1) - p * q);\n\t          }\n\t        }\n\t      }\n\t    }\n\t  }\n\n\t  if (norm === 0) {\n\t    return;\n\t  }\n\n\t  for (n = nn - 1; n >= 0; n--) {\n\t    p = d[n];\n\t    q = e[n];\n\n\t    if (q === 0) {\n\t      l = n;\n\t      H.set(n, n, 1);\n\t      for (i = n - 1; i >= 0; i--) {\n\t        w = H.get(i, i) - p;\n\t        r = 0;\n\t        for (j = l; j <= n; j++) {\n\t          r = r + H.get(i, j) * H.get(j, n);\n\t        }\n\n\t        if (e[i] < 0) {\n\t          z = w;\n\t          s = r;\n\t        } else {\n\t          l = i;\n\t          if (e[i] === 0) {\n\t            H.set(i, n, w !== 0 ? -r / w : -r / (eps * norm));\n\t          } else {\n\t            x = H.get(i, i + 1);\n\t            y = H.get(i + 1, i);\n\t            q = (d[i] - p) * (d[i] - p) + e[i] * e[i];\n\t            t = (x * s - z * r) / q;\n\t            H.set(i, n, t);\n\t            H.set(\n\t              i + 1,\n\t              n,\n\t              Math.abs(x) > Math.abs(z) ? (-r - w * t) / x : (-s - y * t) / z,\n\t            );\n\t          }\n\n\t          t = Math.abs(H.get(i, n));\n\t          if (eps * t * t > 1) {\n\t            for (j = i; j <= n; j++) {\n\t              H.set(j, n, H.get(j, n) / t);\n\t            }\n\t          }\n\t        }\n\t      }\n\t    } else if (q < 0) {\n\t      l = n - 1;\n\n\t      if (Math.abs(H.get(n, n - 1)) > Math.abs(H.get(n - 1, n))) {\n\t        H.set(n - 1, n - 1, q / H.get(n, n - 1));\n\t        H.set(n - 1, n, -(H.get(n, n) - p) / H.get(n, n - 1));\n\t      } else {\n\t        cdivres = cdiv(0, -H.get(n - 1, n), H.get(n - 1, n - 1) - p, q);\n\t        H.set(n - 1, n - 1, cdivres[0]);\n\t        H.set(n - 1, n, cdivres[1]);\n\t      }\n\n\t      H.set(n, n - 1, 0);\n\t      H.set(n, n, 1);\n\t      for (i = n - 2; i >= 0; i--) {\n\t        ra = 0;\n\t        sa = 0;\n\t        for (j = l; j <= n; j++) {\n\t          ra = ra + H.get(i, j) * H.get(j, n - 1);\n\t          sa = sa + H.get(i, j) * H.get(j, n);\n\t        }\n\n\t        w = H.get(i, i) - p;\n\n\t        if (e[i] < 0) {\n\t          z = w;\n\t          r = ra;\n\t          s = sa;\n\t        } else {\n\t          l = i;\n\t          if (e[i] === 0) {\n\t            cdivres = cdiv(-ra, -sa, w, q);\n\t            H.set(i, n - 1, cdivres[0]);\n\t            H.set(i, n, cdivres[1]);\n\t          } else {\n\t            x = H.get(i, i + 1);\n\t            y = H.get(i + 1, i);\n\t            vr = (d[i] - p) * (d[i] - p) + e[i] * e[i] - q * q;\n\t            vi = (d[i] - p) * 2 * q;\n\t            if (vr === 0 && vi === 0) {\n\t              vr =\n\t                eps *\n\t                norm *\n\t                (Math.abs(w) +\n\t                  Math.abs(q) +\n\t                  Math.abs(x) +\n\t                  Math.abs(y) +\n\t                  Math.abs(z));\n\t            }\n\t            cdivres = cdiv(\n\t              x * r - z * ra + q * sa,\n\t              x * s - z * sa - q * ra,\n\t              vr,\n\t              vi,\n\t            );\n\t            H.set(i, n - 1, cdivres[0]);\n\t            H.set(i, n, cdivres[1]);\n\t            if (Math.abs(x) > Math.abs(z) + Math.abs(q)) {\n\t              H.set(\n\t                i + 1,\n\t                n - 1,\n\t                (-ra - w * H.get(i, n - 1) + q * H.get(i, n)) / x,\n\t              );\n\t              H.set(\n\t                i + 1,\n\t                n,\n\t                (-sa - w * H.get(i, n) - q * H.get(i, n - 1)) / x,\n\t              );\n\t            } else {\n\t              cdivres = cdiv(\n\t                -r - y * H.get(i, n - 1),\n\t                -s - y * H.get(i, n),\n\t                z,\n\t                q,\n\t              );\n\t              H.set(i + 1, n - 1, cdivres[0]);\n\t              H.set(i + 1, n, cdivres[1]);\n\t            }\n\t          }\n\n\t          t = Math.max(Math.abs(H.get(i, n - 1)), Math.abs(H.get(i, n)));\n\t          if (eps * t * t > 1) {\n\t            for (j = i; j <= n; j++) {\n\t              H.set(j, n - 1, H.get(j, n - 1) / t);\n\t              H.set(j, n, H.get(j, n) / t);\n\t            }\n\t          }\n\t        }\n\t      }\n\t    }\n\t  }\n\n\t  for (i = 0; i < nn; i++) {\n\t    if (i < low || i > high) {\n\t      for (j = i; j < nn; j++) {\n\t        V.set(i, j, H.get(i, j));\n\t      }\n\t    }\n\t  }\n\n\t  for (j = nn - 1; j >= low; j--) {\n\t    for (i = low; i <= high; i++) {\n\t      z = 0;\n\t      for (k = low; k <= Math.min(j, high); k++) {\n\t        z = z + V.get(i, k) * H.get(k, j);\n\t      }\n\t      V.set(i, j, z);\n\t    }\n\t  }\n\t}\n\n\tfunction cdiv(xr, xi, yr, yi) {\n\t  let r, d;\n\t  if (Math.abs(yr) > Math.abs(yi)) {\n\t    r = yi / yr;\n\t    d = yr + r * yi;\n\t    return [(xr + r * xi) / d, (xi - r * xr) / d];\n\t  } else {\n\t    r = yr / yi;\n\t    d = yi + r * yr;\n\t    return [(r * xr + xi) / d, (r * xi - xr) / d];\n\t  }\n\t}\n\n\tclass CholeskyDecomposition {\n\t  constructor(value) {\n\t    value = WrapperMatrix2D.checkMatrix(value);\n\t    if (!value.isSymmetric()) {\n\t      throw new Error('Matrix is not symmetric');\n\t    }\n\n\t    let a = value;\n\t    let dimension = a.rows;\n\t    let l = new Matrix(dimension, dimension);\n\t    let positiveDefinite = true;\n\t    let i, j, k;\n\n\t    for (j = 0; j < dimension; j++) {\n\t      let d = 0;\n\t      for (k = 0; k < j; k++) {\n\t        let s = 0;\n\t        for (i = 0; i < k; i++) {\n\t          s += l.get(k, i) * l.get(j, i);\n\t        }\n\t        s = (a.get(j, k) - s) / l.get(k, k);\n\t        l.set(j, k, s);\n\t        d = d + s * s;\n\t      }\n\n\t      d = a.get(j, j) - d;\n\n\t      positiveDefinite &&= d > 0;\n\t      l.set(j, j, Math.sqrt(Math.max(d, 0)));\n\t      for (k = j + 1; k < dimension; k++) {\n\t        l.set(j, k, 0);\n\t      }\n\t    }\n\n\t    this.L = l;\n\t    this.positiveDefinite = positiveDefinite;\n\t  }\n\n\t  isPositiveDefinite() {\n\t    return this.positiveDefinite;\n\t  }\n\n\t  solve(value) {\n\t    value = WrapperMatrix2D.checkMatrix(value);\n\n\t    let l = this.L;\n\t    let dimension = l.rows;\n\n\t    if (value.rows !== dimension) {\n\t      throw new Error('Matrix dimensions do not match');\n\t    }\n\t    if (this.isPositiveDefinite() === false) {\n\t      throw new Error('Matrix is not positive definite');\n\t    }\n\n\t    let count = value.columns;\n\t    let B = value.clone();\n\t    let i, j, k;\n\n\t    for (k = 0; k < dimension; k++) {\n\t      for (j = 0; j < count; j++) {\n\t        for (i = 0; i < k; i++) {\n\t          B.set(k, j, B.get(k, j) - B.get(i, j) * l.get(k, i));\n\t        }\n\t        B.set(k, j, B.get(k, j) / l.get(k, k));\n\t      }\n\t    }\n\n\t    for (k = dimension - 1; k >= 0; k--) {\n\t      for (j = 0; j < count; j++) {\n\t        for (i = k + 1; i < dimension; i++) {\n\t          B.set(k, j, B.get(k, j) - B.get(i, j) * l.get(i, k));\n\t        }\n\t        B.set(k, j, B.get(k, j) / l.get(k, k));\n\t      }\n\t    }\n\n\t    return B;\n\t  }\n\n\t  get lowerTriangularMatrix() {\n\t    return this.L;\n\t  }\n\t}\n\n\tclass nipals {\n\t  constructor(X, options = {}) {\n\t    X = WrapperMatrix2D.checkMatrix(X);\n\t    let { Y } = options;\n\t    const {\n\t      scaleScores = false,\n\t      maxIterations = 1000,\n\t      terminationCriteria = 1e-10,\n\t    } = options;\n\n\t    let u;\n\t    if (Y) {\n\t      if (isAnyArray.isAnyArray(Y) && typeof Y[0] === 'number') {\n\t        Y = Matrix.columnVector(Y);\n\t      } else {\n\t        Y = WrapperMatrix2D.checkMatrix(Y);\n\t      }\n\t      if (Y.rows !== X.rows) {\n\t        throw new Error('Y should have the same number of rows as X');\n\t      }\n\t      u = Y.getColumnVector(0);\n\t    } else {\n\t      u = X.getColumnVector(0);\n\t    }\n\n\t    let diff = 1;\n\t    let t, q, w, tOld;\n\n\t    for (\n\t      let counter = 0;\n\t      counter < maxIterations && diff > terminationCriteria;\n\t      counter++\n\t    ) {\n\t      w = X.transpose().mmul(u).div(u.transpose().mmul(u).get(0, 0));\n\t      w = w.div(w.norm());\n\n\t      t = X.mmul(w).div(w.transpose().mmul(w).get(0, 0));\n\n\t      if (counter > 0) {\n\t        diff = t.clone().sub(tOld).pow(2).sum();\n\t      }\n\t      tOld = t.clone();\n\n\t      if (Y) {\n\t        q = Y.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n\t        q = q.div(q.norm());\n\n\t        u = Y.mmul(q).div(q.transpose().mmul(q).get(0, 0));\n\t      } else {\n\t        u = t;\n\t      }\n\t    }\n\n\t    if (Y) {\n\t      let p = X.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n\t      p = p.div(p.norm());\n\t      let xResidual = X.clone().sub(t.clone().mmul(p.transpose()));\n\t      let residual = u.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n\t      let yResidual = Y.clone().sub(\n\t        t.clone().mulS(residual.get(0, 0)).mmul(q.transpose()),\n\t      );\n\n\t      this.t = t;\n\t      this.p = p.transpose();\n\t      this.w = w.transpose();\n\t      this.q = q;\n\t      this.u = u;\n\t      this.s = t.transpose().mmul(t);\n\t      this.xResidual = xResidual;\n\t      this.yResidual = yResidual;\n\t      this.betas = residual;\n\t    } else {\n\t      this.w = w.transpose();\n\t      this.s = t.transpose().mmul(t).sqrt();\n\t      if (scaleScores) {\n\t        this.t = t.clone().div(this.s.get(0, 0));\n\t      } else {\n\t        this.t = t;\n\t      }\n\t      this.xResidual = X.sub(t.mmul(w.transpose()));\n\t    }\n\t  }\n\t}\n\n\tmatrix.AbstractMatrix = AbstractMatrix;\n\tmatrix.CHO = CholeskyDecomposition;\n\tmatrix.CholeskyDecomposition = CholeskyDecomposition;\n\tmatrix.DistanceMatrix = DistanceMatrix;\n\tmatrix.EVD = EigenvalueDecomposition;\n\tmatrix.EigenvalueDecomposition = EigenvalueDecomposition;\n\tmatrix.LU = LuDecomposition;\n\tmatrix.LuDecomposition = LuDecomposition;\n\tmatrix.Matrix = Matrix;\n\tmatrix.MatrixColumnSelectionView = MatrixColumnSelectionView;\n\tmatrix.MatrixColumnView = MatrixColumnView;\n\tmatrix.MatrixFlipColumnView = MatrixFlipColumnView;\n\tmatrix.MatrixFlipRowView = MatrixFlipRowView;\n\tmatrix.MatrixRowSelectionView = MatrixRowSelectionView;\n\tmatrix.MatrixRowView = MatrixRowView;\n\tmatrix.MatrixSelectionView = MatrixSelectionView;\n\tmatrix.MatrixSubView = MatrixSubView;\n\tmatrix.MatrixTransposeView = MatrixTransposeView;\n\tmatrix.NIPALS = nipals;\n\tmatrix.Nipals = nipals;\n\tmatrix.QR = QrDecomposition;\n\tmatrix.QrDecomposition = QrDecomposition;\n\tmatrix.SVD = SingularValueDecomposition;\n\tmatrix.SingularValueDecomposition = SingularValueDecomposition;\n\tmatrix.SymmetricMatrix = SymmetricMatrix;\n\tmatrix.WrapperMatrix1D = WrapperMatrix1D;\n\tmatrix.WrapperMatrix2D = WrapperMatrix2D;\n\tmatrix.correlation = correlation;\n\tmatrix.covariance = covariance;\n\tmatrix.default = Matrix;\n\tmatrix.determinant = determinant;\n\tmatrix.inverse = inverse;\n\tmatrix.linearDependencies = linearDependencies;\n\tmatrix.pseudoInverse = pseudoInverse;\n\tmatrix.solve = solve;\n\tmatrix.wrap = wrap;\n\treturn matrix;\n}\n\nexport { requireMatrix as __require };\n//# sourceMappingURL=matrix2.js.map\n"],"names":["hasRequiredMatrix","requireMatrix","matrix","isAnyArray","require$$0","rescale","require$$1","indent","indentData","inspectMatrix","inspectMatrixWithOptions","options","maxRows","maxColumns","maxNumSize","padMinus","inspectData","rows","columns","maxI","maxJ","result","loop","i","j","line","formatNumber","num","formatNumber2","len","str","fix","exp","installMathOperations","AbstractMatrix","Matrix","value","arg0","checkRowIndex","index","outer","max","checkColumnIndex","checkRowVector","vector","checkColumnVector","checkRowIndices","rowIndices","checkColumnIndices","columnIndices","checkRange","startRow","endRow","startColumn","endColumn","checkNumber","newArray","length","array","name","checkNonEmpty","sumByRow","sum","sumByColumn","sumAll","v","productByRow","productByColumn","productAll","varianceByRow","unbiased","mean","cols","variance","sum1","sum2","x","varianceByColumn","varianceAll","size","centerByRow","centerByColumn","centerAll","getScaleByRow","scale","scaleByRow","getScaleByColumn","scaleByColumn","getScaleAll","divider","scaleAll","newRows","newColumns","newData","newMatrix","row","column","random","min","interval","data","l","matrix1","matrix2","callback","copy","previousColumn","isEchelonForm","checked","isReducedEchelonForm","k","h","iMax","tmp","factor","m","n","p","pivot","row1","row2","temp","column1","column2","by","idx","diag","type","vector2","vector1","dot","other","Bcolj","s","scalar","bb","e","a11","b11","a12","b12","a21","b21","a22","b22","m1","m2","m3","m4","m5","m6","m7","c00","c01","c10","c11","a00","a01","a02","a10","a20","b00","b01","b02","b10","b20","m8","m9","m10","m11","m12","m13","m14","m15","m16","m17","m18","m19","m20","m21","m22","m23","c02","c12","c20","c21","c22","y","r1","c1","r2","c2","embed","mat","r","c","resultat","blockMult","a","b","halfRows","halfCols","middle","first","last","q","AxI","IxB","compareFunction","compareNumbers","indices","rowIndex","columnIndex","trace","from","to","center","col","isArrayOfNumbers","element","_Matrix","nRows","nColumns","__privateAdd","_Matrix_instances","__publicField","__privateMethod","initData_fn","arrayData","newRow","_SymmetricMatrix","diagonalSize","_matrix","__privateSet","__privateGet","mask","sidesToRemove","passthroughs","sideIndex","compact","compactSize","SymmetricMatrix","DistanceMatrix","sideSize","compactLength","BaseView","MatrixColumnView","MatrixColumnSelectionView","MatrixFlipColumnView","MatrixFlipRowView","MatrixRowView","MatrixRowSelectionView","MatrixSelectionView","MatrixSubView","MatrixTransposeView","WrapperMatrix1D","WrapperMatrix2D","wrap","LuDecomposition","lu","pivotVector","pivotSign","t","LUcolj","kmax","count","X","determinant","hypotenuse","QrDecomposition","qr","rdiag","nrm","SingularValueDecomposition","computeLeftSingularVectors","computeRightSingularVectors","autoTranspose","wantu","wantv","swapped","aux","nu","ni","U","V","work","si","nct","nrt","mrc","pp","eps","kase","alpha","ks","f","cs","sn","sp","spm1","epm1","sk","ek","shift","g","Y","scols","Ls","VL","vrows","urows","VLU","vcols","ucols","tol","ii","inverse","useSVD","solve","leftHandSide","rightHandSide","d","subMatrix0","subMatrix1","subMatrix2","xrange","exception","range","dependenciesOneRow","error","thresholdValue","thresholdError","returnArray","linearDependencies","results","Abis","pseudoInverse","threshold","svdSolution","covariance","xMatrix","yMatrix","yIsSame","cov","correlation","sdx","sdy","corr","EigenvalueDecomposition","assumeSymmetric","isSymmetric","tred2","tql2","H","ort","orthes","hqr2","hh","dl1","c3","el1","s2","tst1","low","high","nn","exshift","norm","z","iter","w","ra","sa","vr","vi","notlast","cdivres","cdiv","xr","xi","yr","yi","CholeskyDecomposition","dimension","positiveDefinite","B","nipals","scaleScores","maxIterations","terminationCriteria","u","diff","tOld","counter","xResidual","residual","yResidual"],"mappings":";;;;;;;;;;AAIA,IAAIA;AAEJ,SAASC,KAAiB;;AACzB,MAAID,GAAmB,QAAOE;AAC9B,EAAAF,KAAoB,GAEpB,OAAO,eAAeE,GAAQ,cAAc,EAAE,OAAO,IAAM;AAE3D,MAAIC,IAAaC,IACbC,IAAUC;AAEd,QAAMC,IAAS,IAAI,OAAO,CAAC,GACrBC,KAAa,IAAI,OAAO,CAAC;AAM/B,WAASC,KAAgB;AACvB,WAAOC,GAAyB,IAAI;AAAA,EACtC;AAEA,WAASA,GAAyBR,GAAQS,IAAU,IAAI;AACtD,UAAM;AAAA,MACJ,SAAAC,IAAU;AAAA,MACV,YAAAC,IAAa;AAAA,MACb,YAAAC,IAAa;AAAA,MACb,UAAAC,IAAW;AAAA,IAChB,IAAOJ;AACJ,WAAO,GAAGT,EAAO,YAAY,IAAI;AAAA,EAClCK,CAAM;AAAA,EACNC,EAAU,GAAGQ,GAAYd,GAAQU,GAASC,GAAYC,GAAYC,CAAQ,CAAC;AAAA,EAC3ER,CAAM;AAAA,EACNA,CAAM,SAASL,EAAO,IAAI;AAAA,EAC1BK,CAAM,YAAYL,EAAO,OAAO;AAAA;AAAA,EAEjC;AAEA,WAASc,GAAYd,GAAQU,GAASC,GAAYC,GAAYC,GAAU;AACtE,UAAM,EAAE,MAAAE,GAAM,SAAAC,EAAO,IAAKhB,GACpBiB,IAAO,KAAK,IAAIF,GAAML,CAAO,GAC7BQ,IAAO,KAAK,IAAIF,GAASL,CAAU,GACnCQ,IAAS,CAAA;AAEf,QAAIN,MAAa,QAAQ;AACvB,MAAAA,IAAW;AACX,MAAAO,EAAM,UAASC,IAAI,GAAGA,IAAIJ,GAAMI;AAC9B,iBAASC,IAAI,GAAGA,IAAIJ,GAAMI;AACxB,cAAItB,EAAO,IAAIqB,GAAGC,CAAC,IAAI,GAAG;AACxB,YAAAT,IAAW;AACX,kBAAMO;AAAA,UACR;AAAA,IAGN;AAEA,aAASC,IAAI,GAAGA,IAAIJ,GAAMI,KAAK;AAC7B,UAAIE,IAAO,CAAA;AACX,eAASD,IAAI,GAAGA,IAAIJ,GAAMI;AACxB,QAAAC,EAAK,KAAKC,GAAaxB,EAAO,IAAIqB,GAAGC,CAAC,GAAGV,GAAYC,CAAQ,CAAC;AAEhE,MAAAM,EAAO,KAAK,GAAGI,EAAK,KAAK,GAAG,CAAC,EAAE;AAAA,IACjC;AACA,WAAIL,MAASF,MACXG,EAAOA,EAAO,SAAS,CAAC,KAAK,QAAQH,IAAUL,CAAU,kBAEvDM,MAASF,KACXI,EAAO,KAAK,OAAOJ,IAAOL,CAAO,YAAY,GAExCS,EAAO,KAAK;AAAA,EAAKb,EAAU,EAAE;AAAA,EACtC;AAEA,WAASkB,GAAaC,GAAKb,GAAYC,GAAU;AAC/C,YACEY,KAAO,KAAKZ,IACR,IAAIa,GAAcD,GAAKb,IAAa,CAAC,CAAC,KACtCc,GAAcD,GAAKb,CAAU,GACjC,OAAOA,CAAU;AAAA,EACrB;AAEA,WAASc,GAAcD,GAAKE,GAAK;AAE/B,QAAIC,IAAMH,EAAI,SAAQ;AACtB,QAAIG,EAAI,UAAUD,EAAK,QAAOC;AAI9B,QAAIC,IAAMJ,EAAI,QAAQE,CAAG;AAIzB,QAHIE,EAAI,SAASF,MACfE,IAAMJ,EAAI,QAAQ,KAAK,IAAI,GAAGE,KAAOE,EAAI,SAASF,EAAI,CAAC,IAGvDE,EAAI,UAAUF,KACd,CAACE,EAAI,WAAW,OAAO,KACvB,CAACA,EAAI,WAAW,QAAQ;AAExB,aAAOA;AAIT,QAAIC,IAAML,EAAI,cAAcE,CAAG;AAC/B,WAAIG,EAAI,SAASH,MACfG,IAAML,EAAI,cAAc,KAAK,IAAI,GAAGE,KAAOG,EAAI,SAASH,EAAI,CAAC,IAExDG,EAAI,MAAM,CAAC;AAAA,EACpB;AAEA,WAASC,GAAsBC,GAAgBC,GAAQ;AACrD,IAAAD,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,aAAI,OAAOA,KAAU,WAAiB,KAAK,KAAKA,CAAK,IAC9C,KAAK,KAAKA,CAAK;AAAA,IACxB,GAEAF,EAAe,UAAU,OAAO,SAAcE,GAAO;AACnD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIY,CAAK;AAGzC,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,OAAO,SAAchC,GAAQ;AAEpD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAItB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGpD,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQkC,GAAO;AAE/C,aADkB,IAAID,EAAOjC,CAAM,EAClB,IAAIkC,CAAK;AAAA,IAC5B,GAEAF,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,aAAI,OAAOA,KAAU,WAAiB,KAAK,KAAKA,CAAK,IAC9C,KAAK,KAAKA,CAAK;AAAA,IACxB,GAEAF,EAAe,UAAU,OAAO,SAAcE,GAAO;AACnD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIY,CAAK;AAGzC,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,OAAO,SAAchC,GAAQ;AAEpD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAItB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGpD,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQkC,GAAO;AAE/C,aADkB,IAAID,EAAOjC,CAAM,EAClB,IAAIkC,CAAK;AAAA,IAC5B,GACAF,EAAe,UAAU,WAAWA,EAAe,UAAU,KAC7DA,EAAe,UAAU,YAAYA,EAAe,UAAU,MAC9DA,EAAe,UAAU,YAAYA,EAAe,UAAU,MAC9DA,EAAe,WAAWA,EAAe,KAEzCA,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,aAAI,OAAOA,KAAU,WAAiB,KAAK,KAAKA,CAAK,IAC9C,KAAK,KAAKA,CAAK;AAAA,IACxB,GAEAF,EAAe,UAAU,OAAO,SAAcE,GAAO;AACnD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIY,CAAK;AAGzC,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,OAAO,SAAchC,GAAQ;AAEpD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAItB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGpD,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQkC,GAAO;AAE/C,aADkB,IAAID,EAAOjC,CAAM,EAClB,IAAIkC,CAAK;AAAA,IAC5B,GACAF,EAAe,UAAU,WAAWA,EAAe,UAAU,KAC7DA,EAAe,UAAU,YAAYA,EAAe,UAAU,MAC9DA,EAAe,UAAU,YAAYA,EAAe,UAAU,MAC9DA,EAAe,WAAWA,EAAe,KAEzCA,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,aAAI,OAAOA,KAAU,WAAiB,KAAK,KAAKA,CAAK,IAC9C,KAAK,KAAKA,CAAK;AAAA,IACxB,GAEAF,EAAe,UAAU,OAAO,SAAcE,GAAO;AACnD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIY,CAAK;AAGzC,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,OAAO,SAAchC,GAAQ;AAEpD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAItB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGpD,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQkC,GAAO;AAE/C,aADkB,IAAID,EAAOjC,CAAM,EAClB,IAAIkC,CAAK;AAAA,IAC5B,GACAF,EAAe,UAAU,SAASA,EAAe,UAAU,KAC3DA,EAAe,UAAU,UAAUA,EAAe,UAAU,MAC5DA,EAAe,UAAU,UAAUA,EAAe,UAAU,MAC5DA,EAAe,SAASA,EAAe,KAEvCA,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,aAAI,OAAOA,KAAU,WAAiB,KAAK,KAAKA,CAAK,IAC9C,KAAK,KAAKA,CAAK;AAAA,IACxB,GAEAF,EAAe,UAAU,OAAO,SAAcE,GAAO;AACnD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIY,CAAK;AAGzC,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,OAAO,SAAchC,GAAQ;AAEpD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAItB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGpD,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQkC,GAAO;AAE/C,aADkB,IAAID,EAAOjC,CAAM,EAClB,IAAIkC,CAAK;AAAA,IAC5B,GACAF,EAAe,UAAU,UAAUA,EAAe,UAAU,KAC5DA,EAAe,UAAU,WAAWA,EAAe,UAAU,MAC7DA,EAAe,UAAU,WAAWA,EAAe,UAAU,MAC7DA,EAAe,UAAUA,EAAe,KAExCA,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,aAAI,OAAOA,KAAU,WAAiB,KAAK,KAAKA,CAAK,IAC9C,KAAK,KAAKA,CAAK;AAAA,IACxB,GAEAF,EAAe,UAAU,OAAO,SAAcE,GAAO;AACnD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIY,CAAK;AAGzC,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,OAAO,SAAchC,GAAQ;AAEpD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAItB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGpD,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQkC,GAAO;AAE/C,aADkB,IAAID,EAAOjC,CAAM,EAClB,IAAIkC,CAAK;AAAA,IAC5B,GAEAF,EAAe,UAAU,KAAK,SAAYE,GAAO;AAC/C,aAAI,OAAOA,KAAU,WAAiB,KAAK,IAAIA,CAAK,IAC7C,KAAK,IAAIA,CAAK;AAAA,IACvB,GAEAF,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIY,CAAK;AAGzC,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,MAAM,SAAahC,GAAQ;AAElD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAItB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGpD,aAAO;AAAA,IACT,GAEAU,EAAe,KAAK,SAAYhC,GAAQkC,GAAO;AAE7C,aADkB,IAAID,EAAOjC,CAAM,EAClB,GAAGkC,CAAK;AAAA,IAC3B,GAEAF,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,aAAI,OAAOA,KAAU,WAAiB,KAAK,KAAKA,CAAK,IAC9C,KAAK,KAAKA,CAAK;AAAA,IACxB,GAEAF,EAAe,UAAU,OAAO,SAAcE,GAAO;AACnD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIY,CAAK;AAGzC,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,OAAO,SAAchC,GAAQ;AAEpD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAItB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGpD,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQkC,GAAO;AAE/C,aADkB,IAAID,EAAOjC,CAAM,EAClB,IAAIkC,CAAK;AAAA,IAC5B,GAEAF,EAAe,UAAU,YAAY,SAAmBE,GAAO;AAC7D,aAAI,OAAOA,KAAU,WAAiB,KAAK,WAAWA,CAAK,IACpD,KAAK,WAAWA,CAAK;AAAA,IAC9B,GAEAF,EAAe,UAAU,aAAa,SAAoBE,GAAO;AAC/D,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,KAAKY,CAAK;AAG1C,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,aAAa,SAAoBhC,GAAQ;AAEhE,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,KAAKtB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGrD,aAAO;AAAA,IACT,GAEAU,EAAe,YAAY,SAAmBhC,GAAQkC,GAAO;AAE3D,aADkB,IAAID,EAAOjC,CAAM,EAClB,UAAUkC,CAAK;AAAA,IAClC,GAEAF,EAAe,UAAU,4BAA4B,SAAmCE,GAAO;AAC7F,aAAI,OAAOA,KAAU,WAAiB,KAAK,2BAA2BA,CAAK,IACpE,KAAK,2BAA2BA,CAAK;AAAA,IAC9C,GAEAF,EAAe,UAAU,6BAA6B,SAAoCE,GAAO;AAC/F,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,KAAKY,CAAK;AAG1C,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,6BAA6B,SAAoChC,GAAQ;AAEhG,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,KAAKtB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGrD,aAAO;AAAA,IACT,GAEAU,EAAe,4BAA4B,SAAmChC,GAAQkC,GAAO;AAE3F,aADkB,IAAID,EAAOjC,CAAM,EAClB,0BAA0BkC,CAAK;AAAA,IAClD,GAEAF,EAAe,UAAU,aAAa,SAAoBE,GAAO;AAC/D,aAAI,OAAOA,KAAU,WAAiB,KAAK,YAAYA,CAAK,IACrD,KAAK,YAAYA,CAAK;AAAA,IAC/B,GAEAF,EAAe,UAAU,cAAc,SAAqBE,GAAO;AACjE,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,MAAMY,CAAK;AAG3C,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,cAAc,SAAqBhC,GAAQ;AAElE,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,MAAMtB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGtD,aAAO;AAAA,IACT,GAEAU,EAAe,aAAa,SAAoBhC,GAAQkC,GAAO;AAE7D,aADkB,IAAID,EAAOjC,CAAM,EAClB,WAAWkC,CAAK;AAAA,IACnC,GACAF,EAAe,UAAU,qBAAqBA,EAAe,UAAU,YACvEA,EAAe,UAAU,sBAAsBA,EAAe,UAAU,aACxEA,EAAe,UAAU,sBAAsBA,EAAe,UAAU,aACxEA,EAAe,qBAAqBA,EAAe,YAEnDA,EAAe,UAAU,MAAM,WAAe;AAC5C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,CAAE,KAAK,IAAID,GAAGC,CAAC,CAAE;AAGpC,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQ;AAExC,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,IAAG;AAAA,IACtB,GAEAgC,EAAe,UAAU,MAAM,WAAe;AAC5C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAI,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG3C,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQ;AAExC,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,IAAG;AAAA,IACtB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,MAAM,WAAe;AAC5C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAI,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG3C,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQ;AAExC,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,IAAG;AAAA,IACtB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,MAAM,WAAe;AAC5C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAI,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG3C,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQ;AAExC,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,IAAG;AAAA,IACtB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,SAAS,WAAkB;AAClD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,OAAO,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG9C,aAAO;AAAA,IACT,GAEAU,EAAe,SAAS,SAAgBhC,GAAQ;AAE9C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,OAAM;AAAA,IACzB,GAEAgC,EAAe,UAAU,MAAM,WAAe;AAC5C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAI,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG3C,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQ;AAExC,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,IAAG;AAAA,IACtB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,MAAM,WAAe;AAC5C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAI,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG3C,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQ;AAExC,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,IAAG;AAAA,IACtB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,MAAM,WAAe;AAC5C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAI,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG3C,aAAO;AAAA,IACT,GAEAU,EAAe,MAAM,SAAahC,GAAQ;AAExC,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,IAAG;AAAA,IACtB,GAEAgC,EAAe,UAAU,OAAO,WAAgB;AAC9C,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,KAAK,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG5C,aAAO;AAAA,IACT,GAEAU,EAAe,OAAO,SAAchC,GAAQ;AAE1C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,KAAI;AAAA,IACvB,GAEAgC,EAAe,UAAU,QAAQ,WAAiB;AAChD,eAASX,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,MAAM,KAAK,IAAID,GAAGC,CAAC,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT,GAEAU,EAAe,QAAQ,SAAehC,GAAQ;AAE5C,aADkB,IAAIiC,EAAOjC,CAAM,EAClB,MAAK;AAAA,IACxB,GAEAgC,EAAe,MAAM,SAAahC,GAAQmC,GAAM;AAE9C,aADkB,IAAIF,EAAOjC,CAAM,EAClB,IAAImC,CAAI;AAAA,IAC3B,GAEAH,EAAe,UAAU,MAAM,SAAaE,GAAO;AACjD,aAAI,OAAOA,KAAU,WAAiB,KAAK,KAAKA,CAAK,IAC9C,KAAK,KAAKA,CAAK;AAAA,IACxB,GAEAF,EAAe,UAAU,OAAO,SAAcE,GAAO;AACnD,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,KAAKY,CAAK;AAG1C,aAAO;AAAA,IACT,GAEAF,EAAe,UAAU,OAAO,SAAchC,GAAQ;AAEpD,UADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9B,KAAK,SAASA,EAAO,QACvB,KAAK,YAAYA,EAAO;AACxB,cAAM,IAAI,WAAW,mCAAmC;AAE1D,eAASqB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,KAAKtB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAGrD,aAAO;AAAA,IACT;AAAA,EACF;AASA,WAASc,EAAcpC,GAAQqC,GAAOC,GAAO;AAC3C,QAAIC,IAAMD,IAAQtC,EAAO,OAAOA,EAAO,OAAO;AAC9C,QAAIqC,IAAQ,KAAKA,IAAQE;AACvB,YAAM,IAAI,WAAW,wBAAwB;AAAA,EAEjD;AASA,WAASC,EAAiBxC,GAAQqC,GAAOC,GAAO;AAC9C,QAAIC,IAAMD,IAAQtC,EAAO,UAAUA,EAAO,UAAU;AACpD,QAAIqC,IAAQ,KAAKA,IAAQE;AACvB,YAAM,IAAI,WAAW,2BAA2B;AAAA,EAEpD;AAUA,WAASE,GAAezC,GAAQ0C,GAAQ;AAItC,QAHIA,EAAO,cACTA,IAASA,EAAO,UAAS,IAEvBA,EAAO,WAAW1C,EAAO;AAC3B,YAAM,IAAI;AAAA,QACR;AAAA,MACP;AAEG,WAAO0C;AAAA,EACT;AAUA,WAASC,GAAkB3C,GAAQ0C,GAAQ;AAIzC,QAHIA,EAAO,cACTA,IAASA,EAAO,UAAS,IAEvBA,EAAO,WAAW1C,EAAO;AAC3B,YAAM,IAAI,WAAW,oDAAoD;AAE3E,WAAO0C;AAAA,EACT;AAEA,WAASE,GAAgB5C,GAAQ6C,GAAY;AAC3C,QAAI,CAAC5C,EAAW,WAAW4C,CAAU;AACnC,YAAM,IAAI,UAAU,8BAA8B;AAGpD,aAASxB,IAAI,GAAGA,IAAIwB,EAAW,QAAQxB;AACrC,UAAIwB,EAAWxB,CAAC,IAAI,KAAKwB,EAAWxB,CAAC,KAAKrB,EAAO;AAC/C,cAAM,IAAI,WAAW,8BAA8B;AAAA,EAGzD;AAEA,WAAS8C,GAAmB9C,GAAQ+C,GAAe;AACjD,QAAI,CAAC9C,EAAW,WAAW8C,CAAa;AACtC,YAAM,IAAI,UAAU,iCAAiC;AAGvD,aAAS1B,IAAI,GAAGA,IAAI0B,EAAc,QAAQ1B;AACxC,UAAI0B,EAAc1B,CAAC,IAAI,KAAK0B,EAAc1B,CAAC,KAAKrB,EAAO;AACrD,cAAM,IAAI,WAAW,iCAAiC;AAAA,EAG5D;AAEA,WAASgD,GAAWhD,GAAQiD,GAAUC,GAAQC,GAAaC,GAAW;AACpE,QAAI,UAAU,WAAW;AACvB,YAAM,IAAI,WAAW,sBAAsB;AAM7C,QAJAC,GAAY,YAAYJ,CAAQ,GAChCI,GAAY,UAAUH,CAAM,GAC5BG,GAAY,eAAeF,CAAW,GACtCE,GAAY,aAAaD,CAAS,GAEhCH,IAAWC,KACXC,IAAcC,KACdH,IAAW,KACXA,KAAYjD,EAAO,QACnBkD,IAAS,KACTA,KAAUlD,EAAO,QACjBmD,IAAc,KACdA,KAAenD,EAAO,WACtBoD,IAAY,KACZA,KAAapD,EAAO;AAEpB,YAAM,IAAI,WAAW,oCAAoC;AAAA,EAE7D;AAEA,WAASsD,GAASC,GAAQrB,IAAQ,GAAG;AACnC,QAAIsB,IAAQ,CAAA;AACZ,aAASnC,IAAI,GAAGA,IAAIkC,GAAQlC;AAC1B,MAAAmC,EAAM,KAAKtB,CAAK;AAElB,WAAOsB;AAAA,EACT;AAEA,WAASH,GAAYI,GAAMvB,GAAO;AAChC,QAAI,OAAOA,KAAU;AACnB,YAAM,IAAI,UAAU,GAAGuB,CAAI,mBAAmB;AAAA,EAElD;AAEA,WAASC,GAAc1D,GAAQ;AAC7B,QAAIA,EAAO;AACT,YAAM,IAAI,MAAM,uCAAuC;AAAA,EAE3D;AAEA,WAAS2D,GAAS3D,GAAQ;AACxB,QAAI4D,IAAMN,GAAStD,EAAO,IAAI;AAC9B,aAASqB,IAAI,GAAGA,IAAIrB,EAAO,MAAM,EAAEqB;AACjC,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAAS,EAAEsB;AACpC,QAAAsC,EAAIvC,CAAC,KAAKrB,EAAO,IAAIqB,GAAGC,CAAC;AAG7B,WAAOsC;AAAA,EACT;AAEA,WAASC,GAAY7D,GAAQ;AAC3B,QAAI4D,IAAMN,GAAStD,EAAO,OAAO;AACjC,aAASqB,IAAI,GAAGA,IAAIrB,EAAO,MAAM,EAAEqB;AACjC,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAAS,EAAEsB;AACpC,QAAAsC,EAAItC,CAAC,KAAKtB,EAAO,IAAIqB,GAAGC,CAAC;AAG7B,WAAOsC;AAAA,EACT;AAEA,WAASE,GAAO9D,GAAQ;AACtB,QAAI+D,IAAI;AACR,aAAS1C,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAyC,KAAK/D,EAAO,IAAIqB,GAAGC,CAAC;AAGxB,WAAOyC;AAAA,EACT;AAEA,WAASC,GAAahE,GAAQ;AAC5B,QAAI4D,IAAMN,GAAStD,EAAO,MAAM,CAAC;AACjC,aAASqB,IAAI,GAAGA,IAAIrB,EAAO,MAAM,EAAEqB;AACjC,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAAS,EAAEsB;AACpC,QAAAsC,EAAIvC,CAAC,KAAKrB,EAAO,IAAIqB,GAAGC,CAAC;AAG7B,WAAOsC;AAAA,EACT;AAEA,WAASK,GAAgBjE,GAAQ;AAC/B,QAAI4D,IAAMN,GAAStD,EAAO,SAAS,CAAC;AACpC,aAASqB,IAAI,GAAGA,IAAIrB,EAAO,MAAM,EAAEqB;AACjC,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAAS,EAAEsB;AACpC,QAAAsC,EAAItC,CAAC,KAAKtB,EAAO,IAAIqB,GAAGC,CAAC;AAG7B,WAAOsC;AAAA,EACT;AAEA,WAASM,GAAWlE,GAAQ;AAC1B,QAAI+D,IAAI;AACR,aAAS1C,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAyC,KAAK/D,EAAO,IAAIqB,GAAGC,CAAC;AAGxB,WAAOyC;AAAA,EACT;AAEA,WAASI,GAAcnE,GAAQoE,GAAUC,GAAM;AAC7C,UAAMtD,IAAOf,EAAO,MACdsE,IAAOtE,EAAO,SACduE,IAAW,CAAA;AAEjB,aAASlD,IAAI,GAAGA,IAAIN,GAAMM,KAAK;AAC7B,UAAImD,IAAO,GACPC,IAAO,GACPC,IAAI;AACR,eAASpD,IAAI,GAAGA,IAAIgD,GAAMhD;AACxB,QAAAoD,IAAI1E,EAAO,IAAIqB,GAAGC,CAAC,IAAI+C,EAAKhD,CAAC,GAC7BmD,KAAQE,GACRD,KAAQC,IAAIA;AAEd,MAAIN,IACFG,EAAS,MAAME,IAAQD,IAAOA,IAAQF,MAASA,IAAO,EAAE,IAExDC,EAAS,MAAME,IAAQD,IAAOA,IAAQF,KAAQA,CAAI;AAAA,IAEtD;AACA,WAAOC;AAAA,EACT;AAEA,WAASI,GAAiB3E,GAAQoE,GAAUC,GAAM;AAChD,UAAMtD,IAAOf,EAAO,MACdsE,IAAOtE,EAAO,SACduE,IAAW,CAAA;AAEjB,aAASjD,IAAI,GAAGA,IAAIgD,GAAMhD,KAAK;AAC7B,UAAIkD,IAAO,GACPC,IAAO,GACPC,IAAI;AACR,eAASrD,IAAI,GAAGA,IAAIN,GAAMM;AACxB,QAAAqD,IAAI1E,EAAO,IAAIqB,GAAGC,CAAC,IAAI+C,EAAK/C,CAAC,GAC7BkD,KAAQE,GACRD,KAAQC,IAAIA;AAEd,MAAIN,IACFG,EAAS,MAAME,IAAQD,IAAOA,IAAQzD,MAASA,IAAO,EAAE,IAExDwD,EAAS,MAAME,IAAQD,IAAOA,IAAQzD,KAAQA,CAAI;AAAA,IAEtD;AACA,WAAOwD;AAAA,EACT;AAEA,WAASK,GAAY5E,GAAQoE,GAAUC,GAAM;AAC3C,UAAMtD,IAAOf,EAAO,MACdsE,IAAOtE,EAAO,SACd6E,IAAO9D,IAAOuD;AAEpB,QAAIE,IAAO,GACPC,IAAO,GACPC,IAAI;AACR,aAASrD,IAAI,GAAGA,IAAIN,GAAMM;AACxB,eAASC,IAAI,GAAGA,IAAIgD,GAAMhD;AACxB,QAAAoD,IAAI1E,EAAO,IAAIqB,GAAGC,CAAC,IAAI+C,GACvBG,KAAQE,GACRD,KAAQC,IAAIA;AAGhB,WAAIN,KACMK,IAAQD,IAAOA,IAAQK,MAASA,IAAO,MAEvCJ,IAAQD,IAAOA,IAAQK,KAAQA;AAAA,EAE3C;AAEA,WAASC,GAAY9E,GAAQqE,GAAM;AACjC,aAAShD,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAtB,EAAO,IAAIqB,GAAGC,GAAGtB,EAAO,IAAIqB,GAAGC,CAAC,IAAI+C,EAAKhD,CAAC,CAAC;AAAA,EAGjD;AAEA,WAAS0D,GAAe/E,GAAQqE,GAAM;AACpC,aAAShD,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAtB,EAAO,IAAIqB,GAAGC,GAAGtB,EAAO,IAAIqB,GAAGC,CAAC,IAAI+C,EAAK/C,CAAC,CAAC;AAAA,EAGjD;AAEA,WAAS0D,GAAUhF,GAAQqE,GAAM;AAC/B,aAAShD,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAtB,EAAO,IAAIqB,GAAGC,GAAGtB,EAAO,IAAIqB,GAAGC,CAAC,IAAI+C,CAAI;AAAA,EAG9C;AAEA,WAASY,GAAcjF,GAAQ;AAC7B,UAAMkF,IAAQ,CAAA;AACd,aAAS7D,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB,KAAK;AACpC,UAAIuC,IAAM;AACV,eAAStC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAsC,KAAO5D,EAAO,IAAIqB,GAAGC,CAAC,KAAK,KAAKtB,EAAO,UAAU;AAEnD,MAAAkF,EAAM,KAAK,KAAK,KAAKtB,CAAG,CAAC;AAAA,IAC3B;AACA,WAAOsB;AAAA,EACT;AAEA,WAASC,GAAWnF,GAAQkF,GAAO;AACjC,aAAS7D,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAtB,EAAO,IAAIqB,GAAGC,GAAGtB,EAAO,IAAIqB,GAAGC,CAAC,IAAI4D,EAAM7D,CAAC,CAAC;AAAA,EAGlD;AAEA,WAAS+D,GAAiBpF,GAAQ;AAChC,UAAMkF,IAAQ,CAAA;AACd,aAAS5D,IAAI,GAAGA,IAAItB,EAAO,SAASsB,KAAK;AACvC,UAAIsC,IAAM;AACV,eAASvC,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,QAAAuC,KAAO5D,EAAO,IAAIqB,GAAGC,CAAC,KAAK,KAAKtB,EAAO,OAAO;AAEhD,MAAAkF,EAAM,KAAK,KAAK,KAAKtB,CAAG,CAAC;AAAA,IAC3B;AACA,WAAOsB;AAAA,EACT;AAEA,WAASG,GAAcrF,GAAQkF,GAAO;AACpC,aAAS7D,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAtB,EAAO,IAAIqB,GAAGC,GAAGtB,EAAO,IAAIqB,GAAGC,CAAC,IAAI4D,EAAM5D,CAAC,CAAC;AAAA,EAGlD;AAEA,WAASgE,GAAYtF,GAAQ;AAC3B,UAAMuF,IAAUvF,EAAO,OAAO;AAC9B,QAAI4D,IAAM;AACV,aAAStC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,eAASD,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,QAAAuC,KAAO5D,EAAO,IAAIqB,GAAGC,CAAC,KAAK,IAAIiE;AAGnC,WAAO,KAAK,KAAK3B,CAAG;AAAA,EACtB;AAEA,WAAS4B,GAASxF,GAAQkF,GAAO;AAC/B,aAAS7D,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,eAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,QAAAtB,EAAO,IAAIqB,GAAGC,GAAGtB,EAAO,IAAIqB,GAAGC,CAAC,IAAI4D,CAAK;AAAA,EAG/C;AAAA,EAEA,MAAMlD,EAAe;AAAA,IACnB,OAAO,YAAYyD,GAASC,GAAYC,GAAS;AAE/C,UADaF,IAAUC,MACRC,EAAQ;AACrB,cAAM,IAAI,WAAW,6CAA6C;AAEpE,UAAIC,IAAY,IAAI3D,EAAOwD,GAASC,CAAU;AAC9C,eAASG,IAAM,GAAGA,IAAMJ,GAASI;AAC/B,iBAASC,IAAS,GAAGA,IAASJ,GAAYI;AACxC,UAAAF,EAAU,IAAIC,GAAKC,GAAQH,EAAQE,IAAMH,IAAaI,CAAM,CAAC;AAGjE,aAAOF;AAAA,IACT;AAAA,IAEA,OAAO,UAAUD,GAAS;AACxB,UAAIjD,IAAS,IAAIT,EAAO,GAAG0D,EAAQ,MAAM;AACzC,eAAStE,IAAI,GAAGA,IAAIsE,EAAQ,QAAQtE;AAClC,QAAAqB,EAAO,IAAI,GAAGrB,GAAGsE,EAAQtE,CAAC,CAAC;AAE7B,aAAOqB;AAAA,IACT;AAAA,IAEA,OAAO,aAAaiD,GAAS;AAC3B,UAAIjD,IAAS,IAAIT,EAAO0D,EAAQ,QAAQ,CAAC;AACzC,eAAStE,IAAI,GAAGA,IAAIsE,EAAQ,QAAQtE;AAClC,QAAAqB,EAAO,IAAIrB,GAAG,GAAGsE,EAAQtE,CAAC,CAAC;AAE7B,aAAOqB;AAAA,IACT;AAAA,IAEA,OAAO,MAAM3B,GAAMC,GAAS;AAC1B,aAAO,IAAIiB,EAAOlB,GAAMC,CAAO;AAAA,IACjC;AAAA,IAEA,OAAO,KAAKD,GAAMC,GAAS;AACzB,aAAO,IAAIiB,EAAOlB,GAAMC,CAAO,EAAE,KAAK,CAAC;AAAA,IACzC;AAAA,IAEA,OAAO,KAAKD,GAAMC,GAASP,IAAU,CAAA,GAAI;AACvC,UAAI,OAAOA,KAAY;AACrB,cAAM,IAAI,UAAU,2BAA2B;AAEjD,YAAM,EAAE,QAAAsF,IAAS,KAAK,OAAM,IAAKtF;AACjC,UAAIT,IAAS,IAAIiC,EAAOlB,GAAMC,CAAO;AACrC,eAASK,IAAI,GAAGA,IAAIN,GAAMM;AACxB,iBAASC,IAAI,GAAGA,IAAIN,GAASM;AAC3B,UAAAtB,EAAO,IAAIqB,GAAGC,GAAGyE,EAAM,CAAE;AAG7B,aAAO/F;AAAA,IACT;AAAA,IAEA,OAAO,QAAQe,GAAMC,GAASP,IAAU,CAAA,GAAI;AAC1C,UAAI,OAAOA,KAAY;AACrB,cAAM,IAAI,UAAU,2BAA2B;AAEjD,YAAM,EAAE,KAAAuF,IAAM,GAAG,KAAAzD,IAAM,KAAM,QAAAwD,IAAS,KAAK,OAAM,IAAKtF;AACtD,UAAI,CAAC,OAAO,UAAUuF,CAAG,EAAG,OAAM,IAAI,UAAU,wBAAwB;AACxE,UAAI,CAAC,OAAO,UAAUzD,CAAG,EAAG,OAAM,IAAI,UAAU,wBAAwB;AACxE,UAAIyD,KAAOzD,EAAK,OAAM,IAAI,WAAW,8BAA8B;AACnE,UAAI0D,IAAW1D,IAAMyD,GACjBhG,IAAS,IAAIiC,EAAOlB,GAAMC,CAAO;AACrC,eAASK,IAAI,GAAGA,IAAIN,GAAMM;AACxB,iBAASC,IAAI,GAAGA,IAAIN,GAASM,KAAK;AAChC,cAAIY,IAAQ8D,IAAM,KAAK,MAAMD,EAAM,IAAKE,CAAQ;AAChD,UAAAjG,EAAO,IAAIqB,GAAGC,GAAGY,CAAK;AAAA,QACxB;AAEF,aAAOlC;AAAA,IACT;AAAA,IAEA,OAAO,IAAIe,GAAMC,GAASkB,GAAO;AAC/B,MAAIlB,MAAY,WAAWA,IAAUD,IACjCmB,MAAU,WAAWA,IAAQ;AACjC,UAAI8D,IAAM,KAAK,IAAIjF,GAAMC,CAAO,GAC5BhB,IAAS,KAAK,MAAMe,GAAMC,CAAO;AACrC,eAASK,IAAI,GAAGA,IAAI2E,GAAK3E;AACvB,QAAArB,EAAO,IAAIqB,GAAGA,GAAGa,CAAK;AAExB,aAAOlC;AAAA,IACT;AAAA,IAEA,OAAO,KAAKkG,GAAMnF,GAAMC,GAAS;AAC/B,UAAImF,IAAID,EAAK;AACb,MAAInF,MAAS,WAAWA,IAAOoF,IAC3BnF,MAAY,WAAWA,IAAUD;AACrC,UAAIiF,IAAM,KAAK,IAAIG,GAAGpF,GAAMC,CAAO,GAC/BhB,IAAS,KAAK,MAAMe,GAAMC,CAAO;AACrC,eAASK,IAAI,GAAGA,IAAI2E,GAAK3E;AACvB,QAAArB,EAAO,IAAIqB,GAAGA,GAAG6E,EAAK7E,CAAC,CAAC;AAE1B,aAAOrB;AAAA,IACT;AAAA,IAEA,OAAO,IAAIoG,GAASC,GAAS;AAC3B,MAAAD,IAAU,KAAK,YAAYA,CAAO,GAClCC,IAAU,KAAK,YAAYA,CAAO;AAClC,UAAItF,IAAOqF,EAAQ,MACfpF,IAAUoF,EAAQ,SAClBjF,IAAS,IAAIc,EAAOlB,GAAMC,CAAO;AACrC,eAASK,IAAI,GAAGA,IAAIN,GAAMM;AACxB,iBAASC,IAAI,GAAGA,IAAIN,GAASM;AAC3B,UAAAH,EAAO,IAAIE,GAAGC,GAAG,KAAK,IAAI8E,EAAQ,IAAI/E,GAAGC,CAAC,GAAG+E,EAAQ,IAAIhF,GAAGC,CAAC,CAAC,CAAC;AAGnE,aAAOH;AAAA,IACT;AAAA,IAEA,OAAO,IAAIiF,GAASC,GAAS;AAC3B,MAAAD,IAAU,KAAK,YAAYA,CAAO,GAClCC,IAAU,KAAK,YAAYA,CAAO;AAClC,UAAItF,IAAOqF,EAAQ,MACfpF,IAAUoF,EAAQ,SAClBjF,IAAS,IAAI,KAAKJ,GAAMC,CAAO;AACnC,eAASK,IAAI,GAAGA,IAAIN,GAAMM;AACxB,iBAASC,IAAI,GAAGA,IAAIN,GAASM;AAC3B,UAAAH,EAAO,IAAIE,GAAGC,GAAG,KAAK,IAAI8E,EAAQ,IAAI/E,GAAGC,CAAC,GAAG+E,EAAQ,IAAIhF,GAAGC,CAAC,CAAC,CAAC;AAGnE,aAAOH;AAAA,IACT;AAAA,IAEA,OAAO,YAAYe,GAAO;AACxB,aAAOF,EAAe,SAASE,CAAK,IAAIA,IAAQ,IAAID,EAAOC,CAAK;AAAA,IAClE;AAAA,IAEA,OAAO,SAASA,GAAO;AACrB,aAAOA,KAAS,QAAQA,EAAM,UAAU;AAAA,IAC1C;AAAA,IAEA,IAAI,OAAO;AACT,aAAO,KAAK,OAAO,KAAK;AAAA,IAC1B;AAAA,IAEA,MAAMoE,GAAU;AACd,UAAI,OAAOA,KAAa;AACtB,cAAM,IAAI,UAAU,6BAA6B;AAEnD,eAASjF,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,UAAAgF,EAAS,KAAK,MAAMjF,GAAGC,CAAC;AAG5B,aAAO;AAAA,IACT;AAAA,IAEA,YAAY;AACV,UAAIkC,IAAQ,CAAA;AACZ,eAASnC,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,UAAAkC,EAAM,KAAK,KAAK,IAAInC,GAAGC,CAAC,CAAC;AAG7B,aAAOkC;AAAA,IACT;AAAA,IAEA,YAAY;AACV,UAAI+C,IAAO,CAAA;AACX,eAASlF,IAAI,GAAGA,IAAI,KAAK,MAAMA,KAAK;AAClC,QAAAkF,EAAK,KAAK,EAAE;AACZ,iBAASjF,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,UAAAiF,EAAKlF,CAAC,EAAE,KAAK,KAAK,IAAIA,GAAGC,CAAC,CAAC;AAAA,MAE/B;AACA,aAAOiF;AAAA,IACT;AAAA,IAEA,SAAS;AACP,aAAO,KAAK,UAAS;AAAA,IACvB;AAAA,IAEA,cAAc;AACZ,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,iBAAiB;AACf,aAAO,KAAK,YAAY;AAAA,IAC1B;AAAA,IAEA,WAAW;AACT,aAAO,KAAK,SAAS,KAAK,KAAK,YAAY;AAAA,IAC7C;AAAA,IAEA,WAAW;AACT,aAAO,KAAK,SAAS,KAAK;AAAA,IAC5B;AAAA,IAEA,UAAU;AACR,aAAO,KAAK,SAAS,KAAK,KAAK,YAAY;AAAA,IAC7C;AAAA,IAEA,cAAc;AACZ,UAAI,KAAK,YAAY;AACnB,iBAASlF,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,mBAASC,IAAI,GAAGA,KAAKD,GAAGC;AACtB,gBAAI,KAAK,IAAID,GAAGC,CAAC,MAAM,KAAK,IAAIA,GAAGD,CAAC;AAClC,qBAAO;AAIb,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA,IAEA,aAAa;AACX,UAAI,CAAC,KAAK,YAAW,EAAI,QAAO;AAEhC,eAASA,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,YAAI,KAAK,IAAIA,GAAGA,CAAC,MAAM,EAAG,QAAO;AAGnC,aAAO;AAAA,IACT;AAAA,IAEA,gBAAgB;AACd,UAAIA,IAAI,GACJC,IAAI,GACJkF,IAAiB,IACjBC,IAAgB,IAChBC,IAAU;AACd,aAAOrF,IAAI,KAAK,QAAQoF,KAAe;AAGrC,aAFAnF,IAAI,GACJoF,IAAU,IACHpF,IAAI,KAAK,WAAWoF,MAAY;AACrC,UAAI,KAAK,IAAIrF,GAAGC,CAAC,MAAM,IACrBA,MACS,KAAK,IAAID,GAAGC,CAAC,MAAM,KAAKA,IAAIkF,KACrCE,IAAU,IACVF,IAAiBlF,MAEjBmF,IAAgB,IAChBC,IAAU;AAGd,QAAArF;AAAA,MACF;AACA,aAAOoF;AAAA,IACT;AAAA,IAEA,uBAAuB;AACrB,UAAIpF,IAAI,GACJC,IAAI,GACJkF,IAAiB,IACjBG,IAAuB,IACvBD,IAAU;AACd,aAAOrF,IAAI,KAAK,QAAQsF,KAAsB;AAG5C,aAFArF,IAAI,GACJoF,IAAU,IACHpF,IAAI,KAAK,WAAWoF,MAAY;AACrC,UAAI,KAAK,IAAIrF,GAAGC,CAAC,MAAM,IACrBA,MACS,KAAK,IAAID,GAAGC,CAAC,MAAM,KAAKA,IAAIkF,KACrCE,IAAU,IACVF,IAAiBlF,MAEjBqF,IAAuB,IACvBD,IAAU;AAGd,iBAASE,IAAItF,IAAI,GAAGsF,IAAI,KAAK,MAAMA;AACjC,UAAI,KAAK,IAAIvF,GAAGuF,CAAC,MAAM,MACrBD,IAAuB;AAG3B,QAAAtF;AAAA,MACF;AACA,aAAOsF;AAAA,IACT;AAAA,IAEA,cAAc;AACZ,UAAIxF,IAAS,KAAK,MAAK,GACnB0F,IAAI,GACJD,IAAI;AACR,aAAOC,IAAI1F,EAAO,QAAQyF,IAAIzF,EAAO,WAAS;AAC5C,YAAI2F,IAAOD;AACX,iBAASxF,IAAIwF,GAAGxF,IAAIF,EAAO,MAAME;AAC/B,UAAIF,EAAO,IAAIE,GAAGuF,CAAC,IAAIzF,EAAO,IAAI2F,GAAMF,CAAC,MACvCE,IAAOzF;AAGX,YAAIF,EAAO,IAAI2F,GAAMF,CAAC,MAAM;AAC1B,UAAAA;AAAA,aACK;AACL,UAAAzF,EAAO,SAAS0F,GAAGC,CAAI;AACvB,cAAIC,IAAM5F,EAAO,IAAI0F,GAAGD,CAAC;AACzB,mBAAStF,IAAIsF,GAAGtF,IAAIH,EAAO,SAASG;AAClC,YAAAH,EAAO,IAAI0F,GAAGvF,GAAGH,EAAO,IAAI0F,GAAGvF,CAAC,IAAIyF,CAAG;AAEzC,mBAAS1F,IAAIwF,IAAI,GAAGxF,IAAIF,EAAO,MAAME,KAAK;AACxC,gBAAI2F,IAAS7F,EAAO,IAAIE,GAAGuF,CAAC,IAAIzF,EAAO,IAAI0F,GAAGD,CAAC;AAC/C,YAAAzF,EAAO,IAAIE,GAAGuF,GAAG,CAAC;AAClB,qBAAStF,IAAIsF,IAAI,GAAGtF,IAAIH,EAAO,SAASG;AACtC,cAAAH,EAAO,IAAIE,GAAGC,GAAGH,EAAO,IAAIE,GAAGC,CAAC,IAAIH,EAAO,IAAI0F,GAAGvF,CAAC,IAAI0F,CAAM;AAAA,UAEjE;AACA,UAAAH,KACAD;AAAA,QACF;AAAA,MACF;AACA,aAAOzF;AAAA,IACT;AAAA,IAEA,qBAAqB;AACnB,UAAIA,IAAS,KAAK,YAAW,GACzB8F,IAAI9F,EAAO,SACX+F,IAAI/F,EAAO,MACX0F,IAAIK,IAAI;AACZ,aAAOL,KAAK;AACV,YAAI1F,EAAO,OAAO0F,CAAC,MAAM;AACvB,UAAAA;AAAA,aACK;AACL,cAAIM,IAAI,GACJC,IAAQ;AACZ,iBAAOD,IAAID,KAAKE,MAAU;AACxB,YAAIjG,EAAO,IAAI0F,GAAGM,CAAC,MAAM,IACvBC,IAAQ,KAERD;AAGJ,mBAAS9F,IAAI,GAAGA,IAAIwF,GAAGxF,KAAK;AAC1B,gBAAI2F,IAAS7F,EAAO,IAAIE,GAAG8F,CAAC;AAC5B,qBAAS7F,IAAI6F,GAAG7F,IAAI2F,GAAG3F,KAAK;AAC1B,kBAAIyF,IAAM5F,EAAO,IAAIE,GAAGC,CAAC,IAAI0F,IAAS7F,EAAO,IAAI0F,GAAGvF,CAAC;AACrD,cAAAH,EAAO,IAAIE,GAAGC,GAAGyF,CAAG;AAAA,YACtB;AAAA,UACF;AACA,UAAAF;AAAA,QACF;AAEF,aAAO1F;AAAA,IACT;AAAA,IAEA,MAAM;AACJ,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAC/C;AAAA,IAEA,MAAM;AACJ,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAC/C;AAAA,IAEA,OAAOV,IAAU,IAAI;AACnB,UAAI,OAAOA,KAAY;AACrB,cAAM,IAAI,UAAU,2BAA2B;AAEjD,YAAM,EAAE,MAAAM,IAAO,GAAG,SAAAC,IAAU,EAAC,IAAKP;AAClC,UAAI,CAAC,OAAO,UAAUM,CAAI,KAAKA,KAAQ;AACrC,cAAM,IAAI,UAAU,iCAAiC;AAEvD,UAAI,CAAC,OAAO,UAAUC,CAAO,KAAKA,KAAW;AAC3C,cAAM,IAAI,UAAU,oCAAoC;AAE1D,UAAIhB,IAAS,IAAIiC,EAAO,KAAK,OAAOlB,GAAM,KAAK,UAAUC,CAAO;AAChE,eAASK,IAAI,GAAGA,IAAIN,GAAMM;AACxB,iBAASC,IAAI,GAAGA,IAAIN,GAASM;AAC3B,UAAAtB,EAAO,aAAa,MAAM,KAAK,OAAOqB,GAAG,KAAK,UAAUC,CAAC;AAG7D,aAAOtB;AAAA,IACT;AAAA,IAEA,KAAKkC,GAAO;AACV,eAASb,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAGY,CAAK;AAGxB,aAAO;AAAA,IACT;AAAA,IAEA,MAAM;AACJ,aAAO,KAAK,KAAK,EAAE;AAAA,IACrB;AAAA,IAEA,OAAOG,GAAO;AACZ,MAAAD,EAAc,MAAMC,CAAK;AACzB,UAAIwD,IAAM,CAAA;AACV,eAASxE,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,QAAAwE,EAAI,KAAK,KAAK,IAAIxD,GAAOhB,CAAC,CAAC;AAE7B,aAAOwE;AAAA,IACT;AAAA,IAEA,aAAaxD,GAAO;AAClB,aAAOJ,EAAO,UAAU,KAAK,OAAOI,CAAK,CAAC;AAAA,IAC5C;AAAA,IAEA,OAAOA,GAAOmB,GAAO;AACnB,MAAApB,EAAc,MAAMC,CAAK,GACzBmB,IAAQf,GAAe,MAAMe,CAAK;AAClC,eAASnC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,aAAK,IAAIgB,GAAOhB,GAAGmC,EAAMnC,CAAC,CAAC;AAE7B,aAAO;AAAA,IACT;AAAA,IAEA,SAASgG,GAAMC,GAAM;AACnB,MAAAlF,EAAc,MAAMiF,CAAI,GACxBjF,EAAc,MAAMkF,CAAI;AACxB,eAASjG,IAAI,GAAGA,IAAI,KAAK,SAASA,KAAK;AACrC,YAAIkG,IAAO,KAAK,IAAIF,GAAMhG,CAAC;AAC3B,aAAK,IAAIgG,GAAMhG,GAAG,KAAK,IAAIiG,GAAMjG,CAAC,CAAC,GACnC,KAAK,IAAIiG,GAAMjG,GAAGkG,CAAI;AAAA,MACxB;AACA,aAAO;AAAA,IACT;AAAA,IAEA,UAAUlF,GAAO;AACf,MAAAG,EAAiB,MAAMH,CAAK;AAC5B,UAAIyD,IAAS,CAAA;AACb,eAASzE,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,QAAAyE,EAAO,KAAK,KAAK,IAAIzE,GAAGgB,CAAK,CAAC;AAEhC,aAAOyD;AAAA,IACT;AAAA,IAEA,gBAAgBzD,GAAO;AACrB,aAAOJ,EAAO,aAAa,KAAK,UAAUI,CAAK,CAAC;AAAA,IAClD;AAAA,IAEA,UAAUA,GAAOmB,GAAO;AACtB,MAAAhB,EAAiB,MAAMH,CAAK,GAC5BmB,IAAQb,GAAkB,MAAMa,CAAK;AACrC,eAASnC,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,aAAK,IAAIA,GAAGgB,GAAOmB,EAAMnC,CAAC,CAAC;AAE7B,aAAO;AAAA,IACT;AAAA,IAEA,YAAYmG,GAASC,GAAS;AAC5B,MAAAjF,EAAiB,MAAMgF,CAAO,GAC9BhF,EAAiB,MAAMiF,CAAO;AAC9B,eAASpG,IAAI,GAAGA,IAAI,KAAK,MAAMA,KAAK;AAClC,YAAIkG,IAAO,KAAK,IAAIlG,GAAGmG,CAAO;AAC9B,aAAK,IAAInG,GAAGmG,GAAS,KAAK,IAAInG,GAAGoG,CAAO,CAAC,GACzC,KAAK,IAAIpG,GAAGoG,GAASF,CAAI;AAAA,MAC3B;AACA,aAAO;AAAA,IACT;AAAA,IAEA,aAAa7E,GAAQ;AACnB,MAAAA,IAASD,GAAe,MAAMC,CAAM;AACpC,eAASrB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIoB,EAAOpB,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT;AAAA,IAEA,aAAaoB,GAAQ;AACnB,MAAAA,IAASD,GAAe,MAAMC,CAAM;AACpC,eAASrB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIoB,EAAOpB,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT;AAAA,IAEA,aAAaoB,GAAQ;AACnB,MAAAA,IAASD,GAAe,MAAMC,CAAM;AACpC,eAASrB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIoB,EAAOpB,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT;AAAA,IAEA,aAAaoB,GAAQ;AACnB,MAAAA,IAASD,GAAe,MAAMC,CAAM;AACpC,eAASrB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIoB,EAAOpB,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT;AAAA,IAEA,gBAAgBoB,GAAQ;AACtB,MAAAA,IAASC,GAAkB,MAAMD,CAAM;AACvC,eAASrB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIoB,EAAOrB,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT;AAAA,IAEA,gBAAgBqB,GAAQ;AACtB,MAAAA,IAASC,GAAkB,MAAMD,CAAM;AACvC,eAASrB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIoB,EAAOrB,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT;AAAA,IAEA,gBAAgBqB,GAAQ;AACtB,MAAAA,IAASC,GAAkB,MAAMD,CAAM;AACvC,eAASrB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIoB,EAAOrB,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT;AAAA,IAEA,gBAAgBqB,GAAQ;AACtB,MAAAA,IAASC,GAAkB,MAAMD,CAAM;AACvC,eAASrB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,eAAK,IAAID,GAAGC,GAAG,KAAK,IAAID,GAAGC,CAAC,IAAIoB,EAAOrB,CAAC,CAAC;AAG7C,aAAO;AAAA,IACT;AAAA,IAEA,OAAOgB,GAAOH,GAAO;AACnB,MAAAE,EAAc,MAAMC,CAAK;AACzB,eAAShB,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,aAAK,IAAIgB,GAAOhB,GAAG,KAAK,IAAIgB,GAAOhB,CAAC,IAAIa,CAAK;AAE/C,aAAO;AAAA,IACT;AAAA,IAEA,UAAUG,GAAOH,GAAO;AACtB,MAAAM,EAAiB,MAAMH,CAAK;AAC5B,eAAShB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,aAAK,IAAIA,GAAGgB,GAAO,KAAK,IAAIhB,GAAGgB,CAAK,IAAIH,CAAK;AAE/C,aAAO;AAAA,IACT;AAAA,IAEA,IAAIwF,GAAI;AACN,UAAI,KAAK;AACP,eAAO;AAET,cAAQA,GAAE;AAAA,QACR,KAAK,OAAO;AACV,gBAAMnF,IAAM,IAAI,MAAM,KAAK,IAAI,EAAE,KAAK,OAAO,iBAAiB;AAC9D,mBAASsD,IAAM,GAAGA,IAAM,KAAK,MAAMA;AACjC,qBAASC,IAAS,GAAGA,IAAS,KAAK,SAASA;AAC1C,cAAI,KAAK,IAAID,GAAKC,CAAM,IAAIvD,EAAIsD,CAAG,MACjCtD,EAAIsD,CAAG,IAAI,KAAK,IAAIA,GAAKC,CAAM;AAIrC,iBAAOvD;AAAA,QACT;AAAA,QACA,KAAK,UAAU;AACb,gBAAMA,IAAM,IAAI,MAAM,KAAK,OAAO,EAAE,KAAK,OAAO,iBAAiB;AACjE,mBAASsD,IAAM,GAAGA,IAAM,KAAK,MAAMA;AACjC,qBAASC,IAAS,GAAGA,IAAS,KAAK,SAASA;AAC1C,cAAI,KAAK,IAAID,GAAKC,CAAM,IAAIvD,EAAIuD,CAAM,MACpCvD,EAAIuD,CAAM,IAAI,KAAK,IAAID,GAAKC,CAAM;AAIxC,iBAAOvD;AAAA,QACT;AAAA,QACA,KAAK,QAAW;AACd,cAAIA,IAAM,KAAK,IAAI,GAAG,CAAC;AACvB,mBAASsD,IAAM,GAAGA,IAAM,KAAK,MAAMA;AACjC,qBAASC,IAAS,GAAGA,IAAS,KAAK,SAASA;AAC1C,cAAI,KAAK,IAAID,GAAKC,CAAM,IAAIvD,MAC1BA,IAAM,KAAK,IAAIsD,GAAKC,CAAM;AAIhC,iBAAOvD;AAAA,QACT;AAAA,QACA;AACE,gBAAM,IAAI,MAAM,mBAAmBmF,CAAE,EAAE;AAAA,MAChD;AAAA,IACG;AAAA,IAEA,WAAW;AACT,MAAAhE,GAAc,IAAI;AAClB,UAAIK,IAAI,KAAK,IAAI,GAAG,CAAC,GACjB4D,IAAM,CAAC,GAAG,CAAC;AACf,eAAStG,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,UAAI,KAAK,IAAID,GAAGC,CAAC,IAAIyC,MACnBA,IAAI,KAAK,IAAI1C,GAAGC,CAAC,GACjBqG,EAAI,CAAC,IAAItG,GACTsG,EAAI,CAAC,IAAIrG;AAIf,aAAOqG;AAAA,IACT;AAAA,IAEA,IAAID,GAAI;AACN,UAAI,KAAK;AACP,eAAO;AAGT,cAAQA,GAAE;AAAA,QACR,KAAK,OAAO;AACV,gBAAM1B,IAAM,IAAI,MAAM,KAAK,IAAI,EAAE,KAAK,OAAO,iBAAiB;AAC9D,mBAASH,IAAM,GAAGA,IAAM,KAAK,MAAMA;AACjC,qBAASC,IAAS,GAAGA,IAAS,KAAK,SAASA;AAC1C,cAAI,KAAK,IAAID,GAAKC,CAAM,IAAIE,EAAIH,CAAG,MACjCG,EAAIH,CAAG,IAAI,KAAK,IAAIA,GAAKC,CAAM;AAIrC,iBAAOE;AAAA,QACT;AAAA,QACA,KAAK,UAAU;AACb,gBAAMA,IAAM,IAAI,MAAM,KAAK,OAAO,EAAE,KAAK,OAAO,iBAAiB;AACjE,mBAASH,IAAM,GAAGA,IAAM,KAAK,MAAMA;AACjC,qBAASC,IAAS,GAAGA,IAAS,KAAK,SAASA;AAC1C,cAAI,KAAK,IAAID,GAAKC,CAAM,IAAIE,EAAIF,CAAM,MACpCE,EAAIF,CAAM,IAAI,KAAK,IAAID,GAAKC,CAAM;AAIxC,iBAAOE;AAAA,QACT;AAAA,QACA,KAAK,QAAW;AACd,cAAIA,IAAM,KAAK,IAAI,GAAG,CAAC;AACvB,mBAASH,IAAM,GAAGA,IAAM,KAAK,MAAMA;AACjC,qBAASC,IAAS,GAAGA,IAAS,KAAK,SAASA;AAC1C,cAAI,KAAK,IAAID,GAAKC,CAAM,IAAIE,MAC1BA,IAAM,KAAK,IAAIH,GAAKC,CAAM;AAIhC,iBAAOE;AAAA,QACT;AAAA,QACA;AACE,gBAAM,IAAI,MAAM,mBAAmB0B,CAAE,EAAE;AAAA,MAChD;AAAA,IACG;AAAA,IAEA,WAAW;AACT,MAAAhE,GAAc,IAAI;AAClB,UAAIK,IAAI,KAAK,IAAI,GAAG,CAAC,GACjB4D,IAAM,CAAC,GAAG,CAAC;AACf,eAAStG,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,UAAI,KAAK,IAAID,GAAGC,CAAC,IAAIyC,MACnBA,IAAI,KAAK,IAAI1C,GAAGC,CAAC,GACjBqG,EAAI,CAAC,IAAItG,GACTsG,EAAI,CAAC,IAAIrG;AAIf,aAAOqG;AAAA,IACT;AAAA,IAEA,OAAO9B,GAAK;AAEV,UADAzD,EAAc,MAAMyD,CAAG,GACnB,KAAK;AACP,eAAO;AAET,UAAI9B,IAAI,KAAK,IAAI8B,GAAK,CAAC;AACvB,eAASxE,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,QAAI,KAAK,IAAIwE,GAAKxE,CAAC,IAAI0C,MACrBA,IAAI,KAAK,IAAI8B,GAAKxE,CAAC;AAGvB,aAAO0C;AAAA,IACT;AAAA,IAEA,YAAY8B,GAAK;AACf,MAAAzD,EAAc,MAAMyD,CAAG,GACvBnC,GAAc,IAAI;AAClB,UAAIK,IAAI,KAAK,IAAI8B,GAAK,CAAC,GACnB8B,IAAM,CAAC9B,GAAK,CAAC;AACjB,eAASxE,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,QAAI,KAAK,IAAIwE,GAAKxE,CAAC,IAAI0C,MACrBA,IAAI,KAAK,IAAI8B,GAAKxE,CAAC,GACnBsG,EAAI,CAAC,IAAItG;AAGb,aAAOsG;AAAA,IACT;AAAA,IAEA,OAAO9B,GAAK;AAEV,UADAzD,EAAc,MAAMyD,CAAG,GACnB,KAAK;AACP,eAAO;AAET,UAAI9B,IAAI,KAAK,IAAI8B,GAAK,CAAC;AACvB,eAASxE,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,QAAI,KAAK,IAAIwE,GAAKxE,CAAC,IAAI0C,MACrBA,IAAI,KAAK,IAAI8B,GAAKxE,CAAC;AAGvB,aAAO0C;AAAA,IACT;AAAA,IAEA,YAAY8B,GAAK;AACf,MAAAzD,EAAc,MAAMyD,CAAG,GACvBnC,GAAc,IAAI;AAClB,UAAIK,IAAI,KAAK,IAAI8B,GAAK,CAAC,GACnB8B,IAAM,CAAC9B,GAAK,CAAC;AACjB,eAASxE,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,QAAI,KAAK,IAAIwE,GAAKxE,CAAC,IAAI0C,MACrBA,IAAI,KAAK,IAAI8B,GAAKxE,CAAC,GACnBsG,EAAI,CAAC,IAAItG;AAGb,aAAOsG;AAAA,IACT;AAAA,IAEA,UAAU7B,GAAQ;AAEhB,UADAtD,EAAiB,MAAMsD,CAAM,GACzB,KAAK;AACP,eAAO;AAET,UAAI/B,IAAI,KAAK,IAAI,GAAG+B,CAAM;AAC1B,eAASzE,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,QAAI,KAAK,IAAIA,GAAGyE,CAAM,IAAI/B,MACxBA,IAAI,KAAK,IAAI1C,GAAGyE,CAAM;AAG1B,aAAO/B;AAAA,IACT;AAAA,IAEA,eAAe+B,GAAQ;AACrB,MAAAtD,EAAiB,MAAMsD,CAAM,GAC7BpC,GAAc,IAAI;AAClB,UAAIK,IAAI,KAAK,IAAI,GAAG+B,CAAM,GACtB6B,IAAM,CAAC,GAAG7B,CAAM;AACpB,eAASzE,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,QAAI,KAAK,IAAIA,GAAGyE,CAAM,IAAI/B,MACxBA,IAAI,KAAK,IAAI1C,GAAGyE,CAAM,GACtB6B,EAAI,CAAC,IAAItG;AAGb,aAAOsG;AAAA,IACT;AAAA,IAEA,UAAU7B,GAAQ;AAEhB,UADAtD,EAAiB,MAAMsD,CAAM,GACzB,KAAK;AACP,eAAO;AAET,UAAI/B,IAAI,KAAK,IAAI,GAAG+B,CAAM;AAC1B,eAASzE,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,QAAI,KAAK,IAAIA,GAAGyE,CAAM,IAAI/B,MACxBA,IAAI,KAAK,IAAI1C,GAAGyE,CAAM;AAG1B,aAAO/B;AAAA,IACT;AAAA,IAEA,eAAe+B,GAAQ;AACrB,MAAAtD,EAAiB,MAAMsD,CAAM,GAC7BpC,GAAc,IAAI;AAClB,UAAIK,IAAI,KAAK,IAAI,GAAG+B,CAAM,GACtB6B,IAAM,CAAC,GAAG7B,CAAM;AACpB,eAASzE,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,QAAI,KAAK,IAAIA,GAAGyE,CAAM,IAAI/B,MACxBA,IAAI,KAAK,IAAI1C,GAAGyE,CAAM,GACtB6B,EAAI,CAAC,IAAItG;AAGb,aAAOsG;AAAA,IACT;AAAA,IAEA,OAAO;AACL,UAAI3B,IAAM,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,GACtC4B,IAAO,CAAA;AACX,eAASvG,IAAI,GAAGA,IAAI2E,GAAK3E;AACvB,QAAAuG,EAAK,KAAK,KAAK,IAAIvG,GAAGA,CAAC,CAAC;AAE1B,aAAOuG;AAAA,IACT;AAAA,IAEA,KAAKC,IAAO,aAAa;AACvB,cAAQA,GAAI;AAAA,QACV,KAAK;AACH,iBAAO,KAAK,IAAG;AAAA,QACjB,KAAK;AACH,iBAAO,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,QACjC;AACE,gBAAM,IAAI,WAAW,sBAAsBA,CAAI,EAAE;AAAA,MAC1D;AAAA,IACG;AAAA,IAEA,gBAAgB;AACd,UAAIjE,IAAM;AACV,eAASvC,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,UAAAsC,KAAO,KAAK,IAAIvC,GAAGC,CAAC,GACpB,KAAK,IAAID,GAAGC,GAAGsC,CAAG;AAGtB,aAAO;AAAA,IACT;AAAA,IAEA,IAAIkE,GAAS;AACX,MAAI9F,EAAe,SAAS8F,CAAO,MAAGA,IAAUA,EAAQ,UAAS;AACjE,UAAIC,IAAU,KAAK,UAAS;AAC5B,UAAIA,EAAQ,WAAWD,EAAQ;AAC7B,cAAM,IAAI,WAAW,mCAAmC;AAE1D,UAAIE,IAAM;AACV,eAAS3G,IAAI,GAAGA,IAAI0G,EAAQ,QAAQ1G;AAClC,QAAA2G,KAAOD,EAAQ1G,CAAC,IAAIyG,EAAQzG,CAAC;AAE/B,aAAO2G;AAAA,IACT;AAAA,IAEA,KAAKC,GAAO;AACV,MAAAA,IAAQhG,EAAO,YAAYgG,CAAK;AAEhC,UAAIhB,IAAI,KAAK,MACTC,IAAI,KAAK,SACTC,IAAIc,EAAM,SAEV9G,IAAS,IAAIc,EAAOgF,GAAGE,CAAC,GAExBe,IAAQ,IAAI,aAAahB,CAAC;AAC9B,eAAS5F,IAAI,GAAGA,IAAI6F,GAAG7F,KAAK;AAC1B,iBAASsF,IAAI,GAAGA,IAAIM,GAAGN;AACrB,UAAAsB,EAAMtB,CAAC,IAAIqB,EAAM,IAAIrB,GAAGtF,CAAC;AAG3B,iBAASD,IAAI,GAAGA,IAAI4F,GAAG5F,KAAK;AAC1B,cAAI8G,IAAI;AACR,mBAASvB,IAAI,GAAGA,IAAIM,GAAGN;AACrB,YAAAuB,KAAK,KAAK,IAAI9G,GAAGuF,CAAC,IAAIsB,EAAMtB,CAAC;AAG/B,UAAAzF,EAAO,IAAIE,GAAGC,GAAG6G,CAAC;AAAA,QACpB;AAAA,MACF;AACA,aAAOhH;AAAA,IACT;AAAA,IAEA,KAAKiH,GAAQ;AACX,UAAI,CAAC,KAAK;AACR,cAAM,IAAI,WAAW,uBAAuB;AAE9C,UAAI,CAAC,OAAO,UAAUA,CAAM,KAAKA,IAAS;AACxC,cAAM,IAAI,WAAW,yCAAyC;AAGhE,UAAIjH,IAASc,EAAO,IAAI,KAAK,IAAI,GAC7BoG,IAAK;AAET,eAASC,IAAIF,GAAQE,KAAK,GAAGA,KAAK;AAChC,SAAKA,IAAI,OAAO,MACdnH,IAASA,EAAO,KAAKkH,CAAE,IAEzBA,IAAKA,EAAG,KAAKA,CAAE;AAEjB,aAAOlH;AAAA,IACT;AAAA,IAEA,YAAY8G,GAAO;AACjB,MAAAA,IAAQhG,EAAO,YAAYgG,CAAK;AAChC,UAAI9G,IAAS,IAAIc,EAAO,GAAG,CAAC;AAC5B,YAAMsG,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBC,IAAMP,EAAM,IAAI,GAAG,CAAC,GACpBQ,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBC,IAAMT,EAAM,IAAI,GAAG,CAAC,GACpBU,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBC,IAAMX,EAAM,IAAI,GAAG,CAAC,GACpBY,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBC,IAAMb,EAAM,IAAI,GAAG,CAAC,GAGpBc,KAAMR,IAAMM,MAAQL,IAAMM,IAC1BE,KAAML,IAAME,KAAOL,GACnBS,IAAKV,KAAOG,IAAMI,IAClBI,IAAKL,KAAOD,IAAMJ,IAClBW,KAAMZ,IAAME,KAAOK,GACnBM,KAAMT,IAAMJ,MAAQC,IAAME,IAC1BW,KAAMZ,IAAMI,MAAQD,IAAME,IAG1BQ,IAAMP,IAAKG,IAAKC,IAAKE,GACrBE,IAAMN,IAAKE,GACXK,IAAMR,IAAKE,GACXO,IAAMV,IAAKC,IAAKC,IAAKG;AAE3B,aAAAjI,EAAO,IAAI,GAAG,GAAGmI,CAAG,GACpBnI,EAAO,IAAI,GAAG,GAAGoI,CAAG,GACpBpI,EAAO,IAAI,GAAG,GAAGqI,CAAG,GACpBrI,EAAO,IAAI,GAAG,GAAGsI,CAAG,GACbtI;AAAA,IACT;AAAA,IAEA,YAAY8G,GAAO;AACjB,MAAAA,IAAQhG,EAAO,YAAYgG,CAAK;AAChC,UAAI9G,IAAS,IAAIc,EAAO,GAAG,CAAC;AAE5B,YAAMyH,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBC,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBC,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBC,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBtB,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBE,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBqB,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBnB,IAAM,KAAK,IAAI,GAAG,CAAC,GACnBE,IAAM,KAAK,IAAI,GAAG,CAAC,GAEnBkB,IAAM9B,EAAM,IAAI,GAAG,CAAC,GACpB+B,IAAM/B,EAAM,IAAI,GAAG,CAAC,GACpBgC,IAAMhC,EAAM,IAAI,GAAG,CAAC,GACpBiC,IAAMjC,EAAM,IAAI,GAAG,CAAC,GACpBO,IAAMP,EAAM,IAAI,GAAG,CAAC,GACpBS,IAAMT,EAAM,IAAI,GAAG,CAAC,GACpBkC,IAAMlC,EAAM,IAAI,GAAG,CAAC,GACpBW,IAAMX,EAAM,IAAI,GAAG,CAAC,GACpBa,IAAMb,EAAM,IAAI,GAAG,CAAC,GAEpBc,KAAMW,IAAMC,IAAMC,IAAMC,IAAMtB,IAAMI,IAAME,KAAOL,GACjDQ,KAAMU,IAAMG,MAAQ,CAACG,IAAMxB,IAC3BS,IAAKV,KAAO,CAACwB,IAAMC,IAAME,IAAM1B,IAAME,IAAMyB,IAAMrB,IACjDI,KAAM,CAACQ,IAAMG,IAAMtB,MAAQwB,IAAMC,IAAMxB,IACvCW,KAAMU,IAAMtB,MAAQ,CAACwB,IAAMC,IAC3BZ,IAAKM,IAAMK,GACXV,KAAM,CAACK,IAAMI,IAAMnB,MAAQoB,IAAME,IAAMvB,IACvC0B,KAAM,CAACV,IAAMI,MAAQG,IAAMvB,IAC3B2B,KAAMP,IAAMnB,MAAQ,CAACoB,IAAME,IAC3BK,KAAOZ,IAAMC,IAAMC,IAAMrB,IAAME,IAAMqB,IAAMnB,KAAOD,GAClD6B,IAAM5B,KAAO,CAACoB,IAAME,IAAMC,IAAM1B,IAAME,IAAMyB,IAAMvB,IAClD4B,KAAO,CAACZ,IAAMjB,IAAME,MAAQL,IAAM2B,IAAMvB,IACxC6B,KAAOb,IAAMf,MAAQL,IAAMI,IAC3B8B,IAAMd,IAAMO,GACZQ,KAAOhC,IAAME,MAAQ,CAACsB,IAAMvB,IAC5BgC,KAAO,CAAChB,IAAMrB,IAAME,MAAQC,IAAMyB,IAAMrB,IACxC+B,KAAOjB,IAAMnB,MAAQC,IAAMI,IAC3BgC,MAAOvC,IAAME,MAAQ,CAAC0B,IAAMrB,IAC5BiC,IAAMpB,IAAMO,GACZc,IAAMvC,IAAMG,GACZqC,IAAMpB,IAAMI,GACZiB,IAAMpB,IAAME,GACZmB,IAAMtC,IAAMC,GAEZQ,KAAMF,IAAKsB,IAAMK,GACjBxB,KAAMR,IAAKG,IAAKC,IAAKC,IAAKoB,IAAME,IAAMC,GACtCS,KAAMhC,IAAKC,IAAKgB,IAAKC,IAAMI,IAAME,IAAME,IACvCtB,KAAMR,IAAKC,IAAKC,IAAKE,IAAKsB,IAAME,IAAMC,GACtCpB,KAAMT,IAAKE,IAAKC,IAAKC,IAAK4B,GAC1BK,KAAMX,IAAME,IAAMC,IAAMC,KAAMG,GAC9BK,KAAMlC,IAAKC,IAAKe,IAAKG,IAAMC,IAAMC,IAAMC,GACvCa,KAAMf,IAAMC,IAAMC,IAAMC,IAAMO,GAC9BM,KAAMpC,IAAKC,IAAKe,IAAKC,IAAKc;AAEhC,aAAAhK,EAAO,IAAI,GAAG,GAAGmI,EAAG,GACpBnI,EAAO,IAAI,GAAG,GAAGoI,EAAG,GACpBpI,EAAO,IAAI,GAAG,GAAGiK,EAAG,GACpBjK,EAAO,IAAI,GAAG,GAAGqI,EAAG,GACpBrI,EAAO,IAAI,GAAG,GAAGsI,EAAG,GACpBtI,EAAO,IAAI,GAAG,GAAGkK,EAAG,GACpBlK,EAAO,IAAI,GAAG,GAAGmK,EAAG,GACpBnK,EAAO,IAAI,GAAG,GAAGoK,EAAG,GACpBpK,EAAO,IAAI,GAAG,GAAGqK,EAAG,GACbrK;AAAA,IACT;AAAA,IAEA,aAAasK,GAAG;AACd,MAAAA,IAAIxJ,EAAO,YAAYwJ,CAAC;AACxB,UAAI/G,IAAI,KAAK,MAAK,GACdgH,IAAKhH,EAAE,MACPiH,IAAKjH,EAAE,SACPkH,IAAKH,EAAE,MACPI,IAAKJ,EAAE;AACX,MAAIE,MAAOC,KAET,QAAQ;AAAA,QACN,eAAeF,CAAE,MAAMC,CAAE,QAAQC,CAAE,MAAMC,CAAE;AAAA,MACpD;AAKK,eAASC,EAAMC,GAAKhL,GAAMuD,GAAM;AAC9B,YAAI0H,IAAID,EAAI,MACRE,IAAIF,EAAI;AACZ,YAAIC,MAAMjL,KAAQkL,MAAM3H;AACtB,iBAAOyH;AACF;AACL,cAAIG,IAAWlK,EAAe,MAAMjB,GAAMuD,CAAI;AAC9C,iBAAA4H,IAAWA,EAAS,aAAaH,GAAK,GAAG,CAAC,GACnCG;AAAA,QACT;AAAA,MACF;AAMA,UAAIF,IAAI,KAAK,IAAIN,GAAIE,CAAE,GACnBK,IAAI,KAAK,IAAIN,GAAIE,CAAE;AACvB,MAAAnH,IAAIoH,EAAMpH,GAAGsH,GAAGC,CAAC,GACjBR,IAAIK,EAAML,GAAGO,GAAGC,CAAC;AAGjB,eAASE,EAAUC,GAAGC,GAAGtL,GAAMuD,GAAM;AAEnC,YAAIvD,KAAQ,OAAOuD,KAAQ;AACzB,iBAAO8H,EAAE,KAAKC,CAAC;AAIjB,QAAItL,IAAO,MAAM,KAAKuD,IAAO,MAAM,KACjC8H,IAAIN,EAAMM,GAAGrL,IAAO,GAAGuD,IAAO,CAAC,GAC/B+H,IAAIP,EAAMO,GAAGtL,IAAO,GAAGuD,IAAO,CAAC,KACtBvD,IAAO,MAAM,KACtBqL,IAAIN,EAAMM,GAAGrL,IAAO,GAAGuD,CAAI,GAC3B+H,IAAIP,EAAMO,GAAGtL,IAAO,GAAGuD,CAAI,KAClBA,IAAO,MAAM,MACtB8H,IAAIN,EAAMM,GAAGrL,GAAMuD,IAAO,CAAC,GAC3B+H,IAAIP,EAAMO,GAAGtL,GAAMuD,IAAO,CAAC;AAG7B,YAAIgI,IAAW,SAASF,EAAE,OAAO,GAAG,EAAE,GAClCG,IAAW,SAASH,EAAE,UAAU,GAAG,EAAE,GAErC7D,IAAM6D,EAAE,UAAU,GAAGE,IAAW,GAAG,GAAGC,IAAW,CAAC,GAClD/D,IAAM6D,EAAE,UAAU,GAAGC,IAAW,GAAG,GAAGC,IAAW,CAAC,GAElD9D,IAAM2D,EAAE,UAAU,GAAGE,IAAW,GAAGC,GAAUH,EAAE,UAAU,CAAC,GAC1D1D,IAAM2D,EAAE,UAAU,GAAGC,IAAW,GAAGC,GAAUF,EAAE,UAAU,CAAC,GAE1D1D,IAAMyD,EAAE,UAAUE,GAAUF,EAAE,OAAO,GAAG,GAAGG,IAAW,CAAC,GACvD3D,IAAMyD,EAAE,UAAUC,GAAUD,EAAE,OAAO,GAAG,GAAGE,IAAW,CAAC,GAEvD1D,IAAMuD,EAAE,UAAUE,GAAUF,EAAE,OAAO,GAAGG,GAAUH,EAAE,UAAU,CAAC,GAC/DtD,IAAMuD,EAAE,UAAUC,GAAUD,EAAE,OAAO,GAAGE,GAAUF,EAAE,UAAU,CAAC,GAG/DtD,IAAKoD;AAAA,UACPnK,EAAe,IAAIuG,GAAKM,CAAG;AAAA,UAC3B7G,EAAe,IAAIwG,GAAKM,CAAG;AAAA,UAC3BwD;AAAA,UACAC;AAAA,QACT,GACWvD,IAAKmD,EAAUnK,EAAe,IAAI2G,GAAKE,CAAG,GAAGL,GAAK8D,GAAUC,CAAQ,GACpEtD,IAAKkD,EAAU5D,GAAKvG,EAAe,IAAI0G,GAAKI,CAAG,GAAGwD,GAAUC,CAAQ,GACpErD,IAAKiD,EAAUtD,GAAK7G,EAAe,IAAI4G,GAAKJ,CAAG,GAAG8D,GAAUC,CAAQ,GACpEpD,IAAKgD,EAAUnK,EAAe,IAAIuG,GAAKE,CAAG,GAAGK,GAAKwD,GAAUC,CAAQ,GACpEnD,IAAK+C;AAAA,UACPnK,EAAe,IAAI2G,GAAKJ,CAAG;AAAA,UAC3BvG,EAAe,IAAIwG,GAAKE,CAAG;AAAA,UAC3B4D;AAAA,UACAC;AAAA,QACT,GACWlD,IAAK8C;AAAA,UACPnK,EAAe,IAAIyG,GAAKI,CAAG;AAAA,UAC3B7G,EAAe,IAAI4G,GAAKE,CAAG;AAAA,UAC3BwD;AAAA,UACAC;AAAA,QACT,GAGW9C,IAAMzH,EAAe,IAAI+G,GAAIG,CAAE;AACnC,QAAAO,EAAI,IAAIN,CAAE,GACVM,EAAI,IAAIJ,CAAE;AACV,YAAIgC,IAAMrJ,EAAe,IAAIiH,GAAIE,CAAE,GAC/BoC,IAAMvJ,EAAe,IAAIgH,GAAIE,CAAE,GAC/BsC,IAAMxJ,EAAe,IAAI+G,GAAIC,CAAE;AACnC,QAAAwC,EAAI,IAAIvC,CAAE,GACVuC,EAAI,IAAIpC,CAAE;AAGV,YAAIjI,IAASa,EAAe,MAAM,IAAIyH,EAAI,MAAM,IAAIA,EAAI,OAAO;AAC/D,eAAAtI,IAASA,EAAO,aAAasI,GAAK,GAAG,CAAC,GACtCtI,IAASA,EAAO,aAAakK,GAAK5B,EAAI,MAAM,CAAC,GAC7CtI,IAASA,EAAO,aAAaoK,GAAK,GAAG9B,EAAI,OAAO,GAChDtI,IAASA,EAAO,aAAaqK,GAAK/B,EAAI,MAAMA,EAAI,OAAO,GAChDtI,EAAO,UAAU,GAAGJ,IAAO,GAAG,GAAGuD,IAAO,CAAC;AAAA,MAClD;AAEA,aAAO6H,EAAUzH,GAAG+G,GAAGO,GAAGC,CAAC;AAAA,IAC7B;AAAA,IAEA,UAAUxL,IAAU,IAAI;AACtB,UAAI,OAAOA,KAAY;AACrB,cAAM,IAAI,UAAU,2BAA2B;AAEjD,YAAM,EAAE,KAAAuF,IAAM,GAAG,KAAAzD,IAAM,EAAC,IAAK9B;AAC7B,UAAI,CAAC,OAAO,SAASuF,CAAG,EAAG,OAAM,IAAI,UAAU,sBAAsB;AACrE,UAAI,CAAC,OAAO,SAASzD,CAAG,EAAG,OAAM,IAAI,UAAU,sBAAsB;AACrE,UAAIyD,KAAOzD,EAAK,OAAM,IAAI,WAAW,8BAA8B;AACnE,UAAIqD,IAAY,IAAI3D,EAAO,KAAK,MAAM,KAAK,OAAO;AAClD,eAASZ,IAAI,GAAGA,IAAI,KAAK,MAAMA,KAAK;AAClC,cAAMwE,IAAM,KAAK,OAAOxE,CAAC;AACzB,QAAIwE,EAAI,SAAS,KACf1F,EAAQ0F,GAAK,EAAE,KAAAG,GAAK,KAAAzD,GAAK,QAAQsD,GAAK,GAExCD,EAAU,OAAOvE,GAAGwE,CAAG;AAAA,MACzB;AACA,aAAOD;AAAA,IACT;AAAA,IAEA,aAAanF,IAAU,IAAI;AACzB,UAAI,OAAOA,KAAY;AACrB,cAAM,IAAI,UAAU,2BAA2B;AAEjD,YAAM,EAAE,KAAAuF,IAAM,GAAG,KAAAzD,IAAM,EAAC,IAAK9B;AAC7B,UAAI,CAAC,OAAO,SAASuF,CAAG,EAAG,OAAM,IAAI,UAAU,sBAAsB;AACrE,UAAI,CAAC,OAAO,SAASzD,CAAG,EAAG,OAAM,IAAI,UAAU,sBAAsB;AACrE,UAAIyD,KAAOzD,EAAK,OAAM,IAAI,WAAW,8BAA8B;AACnE,UAAIqD,IAAY,IAAI3D,EAAO,KAAK,MAAM,KAAK,OAAO;AAClD,eAASZ,IAAI,GAAGA,IAAI,KAAK,SAASA,KAAK;AACrC,cAAMyE,IAAS,KAAK,UAAUzE,CAAC;AAC/B,QAAIyE,EAAO,UACT3F,EAAQ2F,GAAQ;AAAA,UACd,KAAAE;AAAA,UACA,KAAAzD;AAAA,UACA,QAAQuD;AAAA,QACnB,CAAU,GAEHF,EAAU,UAAUvE,GAAGyE,CAAM;AAAA,MAC/B;AACA,aAAOF;AAAA,IACT;AAAA,IAEA,WAAW;AACT,YAAM4G,IAAS,KAAK,KAAK,KAAK,UAAU,CAAC;AACzC,eAASnL,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAIkL,GAAQlL,KAAK;AAC/B,cAAImL,IAAQ,KAAK,IAAIpL,GAAGC,CAAC,GACrBoL,IAAO,KAAK,IAAIrL,GAAG,KAAK,UAAU,IAAIC,CAAC;AAC3C,eAAK,IAAID,GAAGC,GAAGoL,CAAI,GACnB,KAAK,IAAIrL,GAAG,KAAK,UAAU,IAAIC,GAAGmL,CAAK;AAAA,QACzC;AAEF,aAAO;AAAA,IACT;AAAA,IAEA,cAAc;AACZ,YAAMD,IAAS,KAAK,KAAK,KAAK,OAAO,CAAC;AACtC,eAASlL,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,iBAASD,IAAI,GAAGA,IAAImL,GAAQnL,KAAK;AAC/B,cAAIoL,IAAQ,KAAK,IAAIpL,GAAGC,CAAC,GACrBoL,IAAO,KAAK,IAAI,KAAK,OAAO,IAAIrL,GAAGC,CAAC;AACxC,eAAK,IAAID,GAAGC,GAAGoL,CAAI,GACnB,KAAK,IAAI,KAAK,OAAO,IAAIrL,GAAGC,GAAGmL,CAAK;AAAA,QACtC;AAEF,aAAO;AAAA,IACT;AAAA,IAEA,iBAAiBxE,GAAO;AACtB,MAAAA,IAAQhG,EAAO,YAAYgG,CAAK;AAEhC,UAAIhB,IAAI,KAAK,MACTC,IAAI,KAAK,SACTC,IAAIc,EAAM,MACV0E,IAAI1E,EAAM,SAEV9G,IAAS,IAAIc,EAAOgF,IAAIE,GAAGD,IAAIyF,CAAC;AACpC,eAAStL,IAAI,GAAGA,IAAI4F,GAAG5F;AACrB,iBAASC,IAAI,GAAGA,IAAI4F,GAAG5F;AACrB,mBAASsF,IAAI,GAAGA,IAAIO,GAAGP;AACrB,qBAAST,IAAI,GAAGA,IAAIwG,GAAGxG;AACrB,cAAAhF,EAAO,IAAIgG,IAAI9F,IAAIuF,GAAG+F,IAAIrL,IAAI6E,GAAG,KAAK,IAAI9E,GAAGC,CAAC,IAAI2G,EAAM,IAAIrB,GAAGT,CAAC,CAAC;AAKzE,aAAOhF;AAAA,IACT;AAAA,IAEA,aAAa8G,GAAO;AAElB,UADAA,IAAQhG,EAAO,YAAYgG,CAAK,GAC5B,CAAC,KAAK,SAAQ,KAAM,CAACA,EAAM,SAAQ;AACrC,cAAM,IAAI,MAAM,yCAAyC;AAE3D,UAAIhB,IAAI,KAAK,MACTC,IAAIe,EAAM,MACV2E,IAAM,KAAK,iBAAiB3K,EAAO,IAAIiF,GAAGA,CAAC,CAAC,GAC5C2F,IAAM5K,EAAO,IAAIgF,GAAGA,CAAC,EAAE,iBAAiBgB,CAAK;AACjD,aAAO2E,EAAI,IAAIC,CAAG;AAAA,IACpB;AAAA,IAEA,YAAY;AACV,UAAI1L,IAAS,IAAIc,EAAO,KAAK,SAAS,KAAK,IAAI;AAC/C,eAASZ,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,iBAASC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,UAAAH,EAAO,IAAIG,GAAGD,GAAG,KAAK,IAAIA,GAAGC,CAAC,CAAC;AAGnC,aAAOH;AAAA,IACT;AAAA,IAEA,SAAS2L,IAAkBC,IAAgB;AACzC,eAAS1L,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,aAAK,OAAOA,GAAG,KAAK,OAAOA,CAAC,EAAE,KAAKyL,CAAe,CAAC;AAErD,aAAO;AAAA,IACT;AAAA,IAEA,YAAYA,IAAkBC,IAAgB;AAC5C,eAAS1L,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,aAAK,UAAUA,GAAG,KAAK,UAAUA,CAAC,EAAE,KAAKyL,CAAe,CAAC;AAE3D,aAAO;AAAA,IACT;AAAA,IAEA,UAAU7J,GAAUC,GAAQC,GAAaC,GAAW;AAClD,MAAAJ,GAAW,MAAMC,GAAUC,GAAQC,GAAaC,CAAS;AACzD,UAAIwC,IAAY,IAAI3D;AAAA,QAClBiB,IAASD,IAAW;AAAA,QACpBG,IAAYD,IAAc;AAAA,MACjC;AACK,eAAS9B,IAAI4B,GAAU5B,KAAK6B,GAAQ7B;AAClC,iBAASC,IAAI6B,GAAa7B,KAAK8B,GAAW9B;AACxC,UAAAsE,EAAU,IAAIvE,IAAI4B,GAAU3B,IAAI6B,GAAa,KAAK,IAAI9B,GAAGC,CAAC,CAAC;AAG/D,aAAOsE;AAAA,IACT;AAAA,IAEA,aAAaoH,GAAS7J,GAAaC,GAAW;AAG5C,UAFID,MAAgB,WAAWA,IAAc,IACzCC,MAAc,WAAWA,IAAY,KAAK,UAAU,IAEtDD,IAAcC,KACdD,IAAc,KACdA,KAAe,KAAK,WACpBC,IAAY,KACZA,KAAa,KAAK;AAElB,cAAM,IAAI,WAAW,uBAAuB;AAG9C,UAAIwC,IAAY,IAAI3D,EAAO+K,EAAQ,QAAQ5J,IAAYD,IAAc,CAAC;AACtE,eAAS9B,IAAI,GAAGA,IAAI2L,EAAQ,QAAQ3L;AAClC,iBAASC,IAAI6B,GAAa7B,KAAK8B,GAAW9B,KAAK;AAC7C,cAAI0L,EAAQ3L,CAAC,IAAI,KAAK2L,EAAQ3L,CAAC,KAAK,KAAK;AACvC,kBAAM,IAAI,WAAW,2BAA2B2L,EAAQ3L,CAAC,CAAC,EAAE;AAE9D,UAAAuE,EAAU,IAAIvE,GAAGC,IAAI6B,GAAa,KAAK,IAAI6J,EAAQ3L,CAAC,GAAGC,CAAC,CAAC;AAAA,QAC3D;AAEF,aAAOsE;AAAA,IACT;AAAA,IAEA,gBAAgBoH,GAAS/J,GAAUC,GAAQ;AAGzC,UAFID,MAAa,WAAWA,IAAW,IACnCC,MAAW,WAAWA,IAAS,KAAK,OAAO,IAE7CD,IAAWC,KACXD,IAAW,KACXA,KAAY,KAAK,QACjBC,IAAS,KACTA,KAAU,KAAK;AAEf,cAAM,IAAI,WAAW,uBAAuB;AAG9C,UAAI0C,IAAY,IAAI3D,EAAOiB,IAASD,IAAW,GAAG+J,EAAQ,MAAM;AAChE,eAAS3L,IAAI,GAAGA,IAAI2L,EAAQ,QAAQ3L;AAClC,iBAASC,IAAI2B,GAAU3B,KAAK4B,GAAQ5B,KAAK;AACvC,cAAI0L,EAAQ3L,CAAC,IAAI,KAAK2L,EAAQ3L,CAAC,KAAK,KAAK;AACvC,kBAAM,IAAI,WAAW,8BAA8B2L,EAAQ3L,CAAC,CAAC,EAAE;AAEjE,UAAAuE,EAAU,IAAItE,IAAI2B,GAAU5B,GAAG,KAAK,IAAIC,GAAG0L,EAAQ3L,CAAC,CAAC,CAAC;AAAA,QACxD;AAEF,aAAOuE;AAAA,IACT;AAAA,IAEA,aAAa5F,GAAQiD,GAAUE,GAAa;AAE1C,UADAnD,IAASiC,EAAO,YAAYjC,CAAM,GAC9BA,EAAO;AACT,eAAO;AAET,UAAIkD,IAASD,IAAWjD,EAAO,OAAO,GAClCoD,IAAYD,IAAcnD,EAAO,UAAU;AAC/C,MAAAgD,GAAW,MAAMC,GAAUC,GAAQC,GAAaC,CAAS;AACzD,eAAS/B,IAAI,GAAGA,IAAIrB,EAAO,MAAMqB;AAC/B,iBAASC,IAAI,GAAGA,IAAItB,EAAO,SAASsB;AAClC,eAAK,IAAI2B,IAAW5B,GAAG8B,IAAc7B,GAAGtB,EAAO,IAAIqB,GAAGC,CAAC,CAAC;AAG5D,aAAO;AAAA,IACT;AAAA,IAEA,UAAUuB,GAAYE,GAAe;AACnC,MAAAH,GAAgB,MAAMC,CAAU,GAChCC,GAAmB,MAAMC,CAAa;AACtC,UAAI6C,IAAY,IAAI3D,EAAOY,EAAW,QAAQE,EAAc,MAAM;AAClE,eAAS1B,IAAI,GAAGA,IAAIwB,EAAW,QAAQxB,KAAK;AAC1C,YAAI4L,IAAWpK,EAAWxB,CAAC;AAC3B,iBAASC,IAAI,GAAGA,IAAIyB,EAAc,QAAQzB,KAAK;AAC7C,cAAI4L,IAAcnK,EAAczB,CAAC;AACjC,UAAAsE,EAAU,IAAIvE,GAAGC,GAAG,KAAK,IAAI2L,GAAUC,CAAW,CAAC;AAAA,QACrD;AAAA,MACF;AACA,aAAOtH;AAAA,IACT;AAAA,IAEA,QAAQ;AACN,UAAII,IAAM,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,GACtCmH,IAAQ;AACZ,eAAS9L,IAAI,GAAGA,IAAI2E,GAAK3E;AACvB,QAAA8L,KAAS,KAAK,IAAI9L,GAAGA,CAAC;AAExB,aAAO8L;AAAA,IACT;AAAA,IAEA,QAAQ;AACN,aAAO,KAAK,YAAY,KAAK,MAAM,IAAIlL,EAAO,KAAK,MAAM,KAAK,OAAO,CAAC;AAAA,IACxE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,OAAO,KAAKmL,GAAMC,GAAI;AACpB,iBAAW,CAACxH,GAAKC,GAAQ5D,CAAK,KAAKkL,EAAK;AACtC,QAAAC,EAAG,IAAIxH,GAAKC,GAAQ5D,CAAK;AAG3B,aAAOmL;AAAA,IACT;AAAA,IAEA,IAAI3F,GAAI;AACN,cAAQA,GAAE;AAAA,QACR,KAAK;AACH,iBAAO/D,GAAS,IAAI;AAAA,QACtB,KAAK;AACH,iBAAOE,GAAY,IAAI;AAAA,QACzB,KAAK;AACH,iBAAOC,GAAO,IAAI;AAAA,QACpB;AACE,gBAAM,IAAI,MAAM,mBAAmB4D,CAAE,EAAE;AAAA,MAChD;AAAA,IACG;AAAA,IAEA,QAAQA,GAAI;AACV,cAAQA,GAAE;AAAA,QACR,KAAK;AACH,iBAAO1D,GAAa,IAAI;AAAA,QAC1B,KAAK;AACH,iBAAOC,GAAgB,IAAI;AAAA,QAC7B,KAAK;AACH,iBAAOC,GAAW,IAAI;AAAA,QACxB;AACE,gBAAM,IAAI,MAAM,mBAAmBwD,CAAE,EAAE;AAAA,MAChD;AAAA,IACG;AAAA,IAEA,KAAKA,GAAI;AACP,YAAM9D,IAAM,KAAK,IAAI8D,CAAE;AACvB,cAAQA,GAAE;AAAA,QACR,KAAK,OAAO;AACV,mBAASrG,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,YAAAuC,EAAIvC,CAAC,KAAK,KAAK;AAEjB,iBAAOuC;AAAA,QACT;AAAA,QACA,KAAK,UAAU;AACb,mBAASvC,IAAI,GAAGA,IAAI,KAAK,SAASA;AAChC,YAAAuC,EAAIvC,CAAC,KAAK,KAAK;AAEjB,iBAAOuC;AAAA,QACT;AAAA,QACA,KAAK;AACH,iBAAOA,IAAM,KAAK;AAAA,QACpB;AACE,gBAAM,IAAI,MAAM,mBAAmB8D,CAAE,EAAE;AAAA,MAChD;AAAA,IACG;AAAA,IAEA,SAASA,GAAIjH,IAAU,IAAI;AAKzB,UAJI,OAAOiH,KAAO,aAChBjH,IAAUiH,GACVA,IAAK,SAEH,OAAOjH,KAAY;AACrB,cAAM,IAAI,UAAU,2BAA2B;AAEjD,YAAM,EAAE,UAAA2D,IAAW,IAAM,MAAAC,IAAO,KAAK,KAAKqD,CAAE,EAAC,IAAKjH;AAClD,UAAI,OAAO2D,KAAa;AACtB,cAAM,IAAI,UAAU,4BAA4B;AAElD,cAAQsD,GAAE;AAAA,QACR,KAAK,OAAO;AACV,cAAI,CAACzH,EAAW,WAAWoE,CAAI;AAC7B,kBAAM,IAAI,UAAU,uBAAuB;AAE7C,iBAAOF,GAAc,MAAMC,GAAUC,CAAI;AAAA,QAC3C;AAAA,QACA,KAAK,UAAU;AACb,cAAI,CAACpE,EAAW,WAAWoE,CAAI;AAC7B,kBAAM,IAAI,UAAU,uBAAuB;AAE7C,iBAAOM,GAAiB,MAAMP,GAAUC,CAAI;AAAA,QAC9C;AAAA,QACA,KAAK,QAAW;AACd,cAAI,OAAOA,KAAS;AAClB,kBAAM,IAAI,UAAU,uBAAuB;AAE7C,iBAAOO,GAAY,MAAMR,GAAUC,CAAI;AAAA,QACzC;AAAA,QACA;AACE,gBAAM,IAAI,MAAM,mBAAmBqD,CAAE,EAAE;AAAA,MAChD;AAAA,IACG;AAAA,IAEA,kBAAkBA,GAAIjH,GAAS;AAC7B,MAAI,OAAOiH,KAAO,aAChBjH,IAAUiH,GACVA,IAAK;AAEP,YAAMnD,IAAW,KAAK,SAASmD,GAAIjH,CAAO;AAC1C,UAAIiH,MAAO;AACT,eAAO,KAAK,KAAKnD,CAAQ;AAEzB,eAASlD,IAAI,GAAGA,IAAIkD,EAAS,QAAQlD;AACnC,QAAAkD,EAASlD,CAAC,IAAI,KAAK,KAAKkD,EAASlD,CAAC,CAAC;AAErC,aAAOkD;AAAA,IAEX;AAAA,IAEA,OAAOmD,GAAIjH,IAAU,IAAI;AAKvB,UAJI,OAAOiH,KAAO,aAChBjH,IAAUiH,GACVA,IAAK,SAEH,OAAOjH,KAAY;AACrB,cAAM,IAAI,UAAU,2BAA2B;AAEjD,YAAM,EAAE,QAAA6M,IAAS,KAAK,KAAK5F,CAAE,EAAC,IAAKjH;AACnC,cAAQiH,GAAE;AAAA,QACR,KAAK,OAAO;AACV,cAAI,CAACzH,EAAW,WAAWqN,CAAM;AAC/B,kBAAM,IAAI,UAAU,yBAAyB;AAE/C,iBAAAxI,GAAY,MAAMwI,CAAM,GACjB;AAAA,QACT;AAAA,QACA,KAAK,UAAU;AACb,cAAI,CAACrN,EAAW,WAAWqN,CAAM;AAC/B,kBAAM,IAAI,UAAU,yBAAyB;AAE/C,iBAAAvI,GAAe,MAAMuI,CAAM,GACpB;AAAA,QACT;AAAA,QACA,KAAK,QAAW;AACd,cAAI,OAAOA,KAAW;AACpB,kBAAM,IAAI,UAAU,yBAAyB;AAE/C,iBAAAtI,GAAU,MAAMsI,CAAM,GACf;AAAA,QACT;AAAA,QACA;AACE,gBAAM,IAAI,MAAM,mBAAmB5F,CAAE,EAAE;AAAA,MAChD;AAAA,IACG;AAAA,IAEA,MAAMA,GAAIjH,IAAU,IAAI;AAKtB,UAJI,OAAOiH,KAAO,aAChBjH,IAAUiH,GACVA,IAAK,SAEH,OAAOjH,KAAY;AACrB,cAAM,IAAI,UAAU,2BAA2B;AAEjD,UAAIyE,IAAQzE,EAAQ;AACpB,cAAQiH,GAAE;AAAA,QACR,KAAK,OAAO;AACV,cAAIxC,MAAU;AACZ,YAAAA,IAAQD,GAAc,IAAI;AAAA,mBACjB,CAAChF,EAAW,WAAWiF,CAAK;AACrC,kBAAM,IAAI,UAAU,wBAAwB;AAE9C,iBAAAC,GAAW,MAAMD,CAAK,GACf;AAAA,QACT;AAAA,QACA,KAAK,UAAU;AACb,cAAIA,MAAU;AACZ,YAAAA,IAAQE,GAAiB,IAAI;AAAA,mBACpB,CAACnF,EAAW,WAAWiF,CAAK;AACrC,kBAAM,IAAI,UAAU,wBAAwB;AAE9C,iBAAAG,GAAc,MAAMH,CAAK,GAClB;AAAA,QACT;AAAA,QACA,KAAK,QAAW;AACd,cAAIA,MAAU;AACZ,YAAAA,IAAQI,GAAY,IAAI;AAAA,mBACf,OAAOJ,KAAU;AAC1B,kBAAM,IAAI,UAAU,wBAAwB;AAE9C,iBAAAM,GAAS,MAAMN,CAAK,GACb;AAAA,QACT;AAAA,QACA;AACE,gBAAM,IAAI,MAAM,mBAAmBwC,CAAE,EAAE;AAAA,MAChD;AAAA,IACG;AAAA,IAEA,SAASjH,GAAS;AAChB,aAAOD,GAAyB,MAAMC,CAAO;AAAA,IAC/C;AAAA,IAEA,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO,KAAK,QAAO;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,CAAC,UAAU;AACT,eAASoF,IAAM,GAAGA,IAAM,KAAK,MAAMA;AACjC,iBAAS0H,IAAM,GAAGA,IAAM,KAAK,SAASA;AACpC,gBAAM,CAAC1H,GAAK0H,GAAK,KAAK,IAAI1H,GAAK0H,CAAG,CAAC;AAAA,IAGzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,CAAC,SAAS;AACR,eAAS1H,IAAM,GAAGA,IAAM,KAAK,MAAMA;AACjC,iBAAS0H,IAAM,GAAGA,IAAM,KAAK,SAASA;AACpC,gBAAM,KAAK,IAAI1H,GAAK0H,CAAG;AAAA,IAG7B;AAAA,EACH;AAEC,EAAAvL,EAAe,UAAU,QAAQ,UAC7B,OAAO,SAAW,QACpBA,EAAe,UAAU,OAAO,IAAI,4BAA4B,CAAC,IAC/DzB;AAGJ,WAASwM,GAAeX,GAAGC,GAAG;AAC5B,WAAOD,IAAIC;AAAA,EACb;AAEA,WAASmB,GAAiBhK,GAAO;AAC/B,WAAOA,EAAM,MAAM,CAACiK,MACX,OAAOA,KAAY,QAC3B;AAAA,EACH;AAGA,EAAAzL,EAAe,SAASA,EAAe,MACvCA,EAAe,YAAYA,EAAe,SAC1CA,EAAe,WAAWA,EAAe,MACzCA,EAAe,UAAU,WAAWA,EAAe,UAAU,MAC7DA,EAAe,WAAWA,EAAe,KACzCA,EAAe,UAAU,SAASA,EAAe,UAAU,KAC3DA,EAAe,UAAU,gBACvBA,EAAe,UAAU;AAE3B,QAAM0L,KAAN,MAAMA,WAAe1L,EAAe;AAAA,IA0BlC,YAAY2L,GAAOC,GAAU;AAC3B,YAAK;AA3BT,MAAAC,GAAA,MAAAC;AAIE;AAAA;AAAA;AAAA,MAAAC,GAAA;AAwBM,UAAAL,GAAO,SAASC,CAAK;AACvB,QAAAK,GAAA,MAAKF,IAAAG,IAAL,WAAeN,EAAM,MAAMA,EAAM,UACjCD,GAAO,KAAKC,GAAO,IAAI;AAAA,eACd,OAAO,UAAUA,CAAK,KAAKA,KAAS;AAC7C,QAAAK,GAAA,MAAKF,IAAAG,IAAL,WAAeN,GAAOC;AAAA,eACb3N,EAAW,WAAW0N,CAAK,GAAG;AAEvC,cAAMO,IAAYP;AAGlB,YAFAA,IAAQO,EAAU,QAClBN,IAAWD,IAAQO,EAAU,CAAC,EAAE,SAAS,GACrC,OAAON,KAAa;AACtB,gBAAM,IAAI;AAAA,YACR;AAAA,UACX;AAEO,aAAK,OAAO,CAAA;AAEZ,iBAASvM,IAAI,GAAGA,IAAIsM,GAAOtM,KAAK;AAC9B,cAAI6M,EAAU7M,CAAC,EAAE,WAAWuM;AAC1B,kBAAM,IAAI,WAAW,+BAA+B;AAEtD,cAAI,CAACJ,GAAiBU,EAAU7M,CAAC,CAAC;AAChC,kBAAM,IAAI,UAAU,wCAAwC;AAE9D,eAAK,KAAK,KAAK,aAAa,KAAK6M,EAAU7M,CAAC,CAAC,CAAC;AAAA,QAChD;AAEA,aAAK,OAAOsM,GACZ,KAAK,UAAUC;AAAA,MACjB;AACE,cAAM,IAAI;AAAA,UACR;AAAA,QACT;AAAA,IAEG;AAAA,IAEA,IAAIX,GAAUC,GAAahL,GAAO;AAChC,kBAAK,KAAK+K,CAAQ,EAAEC,CAAW,IAAIhL,GAC5B;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,KAAKD,CAAQ,EAAEC,CAAW;AAAA,IACxC;AAAA,IAEA,UAAU7K,GAAO;AACf,aAAAD,EAAc,MAAMC,CAAK,GACzB,KAAK,KAAK,OAAOA,GAAO,CAAC,GACzB,KAAK,QAAQ,GACN;AAAA,IACT;AAAA,IAEA,OAAOA,GAAOmB,GAAO;AACnB,aAAIA,MAAU,WACZA,IAAQnB,GACRA,IAAQ,KAAK,OAEfD,EAAc,MAAMC,GAAO,EAAI,GAC/BmB,IAAQ,aAAa,KAAKf,GAAe,MAAMe,CAAK,CAAC,GACrD,KAAK,KAAK,OAAOnB,GAAO,GAAGmB,CAAK,GAChC,KAAK,QAAQ,GACN;AAAA,IACT;AAAA,IAEA,aAAanB,GAAO;AAClB,MAAAG,EAAiB,MAAMH,CAAK;AAC5B,eAAShB,IAAI,GAAGA,IAAI,KAAK,MAAMA,KAAK;AAClC,cAAM8M,IAAS,IAAI,aAAa,KAAK,UAAU,CAAC;AAChD,iBAAS7M,IAAI,GAAGA,IAAIe,GAAOf;AACzB,UAAA6M,EAAO7M,CAAC,IAAI,KAAK,KAAKD,CAAC,EAAEC,CAAC;AAE5B,iBAASA,IAAIe,IAAQ,GAAGf,IAAI,KAAK,SAASA;AACxC,UAAA6M,EAAO7M,IAAI,CAAC,IAAI,KAAK,KAAKD,CAAC,EAAEC,CAAC;AAEhC,aAAK,KAAKD,CAAC,IAAI8M;AAAA,MACjB;AACA,kBAAK,WAAW,GACT;AAAA,IACT;AAAA,IAEA,UAAU9L,GAAOmB,GAAO;AACtB,MAAI,OAAOA,IAAU,QACnBA,IAAQnB,GACRA,IAAQ,KAAK,UAEfG,EAAiB,MAAMH,GAAO,EAAI,GAClCmB,IAAQb,GAAkB,MAAMa,CAAK;AACrC,eAASnC,IAAI,GAAGA,IAAI,KAAK,MAAMA,KAAK;AAClC,cAAM8M,IAAS,IAAI,aAAa,KAAK,UAAU,CAAC;AAChD,YAAI7M,IAAI;AACR,eAAOA,IAAIe,GAAOf;AAChB,UAAA6M,EAAO7M,CAAC,IAAI,KAAK,KAAKD,CAAC,EAAEC,CAAC;AAG5B,aADA6M,EAAO7M,GAAG,IAAIkC,EAAMnC,CAAC,GACdC,IAAI,KAAK,UAAU,GAAGA;AAC3B,UAAA6M,EAAO7M,CAAC,IAAI,KAAK,KAAKD,CAAC,EAAEC,IAAI,CAAC;AAEhC,aAAK,KAAKD,CAAC,IAAI8M;AAAA,MACjB;AACA,kBAAK,WAAW,GACT;AAAA,IACT;AAAA,EACH;AAlIC,EAAAL,KAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWEG,KAAS,SAACN,GAAOC,GAAU;AAGzB,QAFA,KAAK,OAAO,CAAA,GAER,OAAO,UAAUA,CAAQ,KAAKA,KAAY;AAC5C,eAASvM,IAAI,GAAGA,IAAIsM,GAAOtM;AACzB,aAAK,KAAK,KAAK,IAAI,aAAauM,CAAQ,CAAC;AAAA;AAG3C,YAAM,IAAI,UAAU,qCAAqC;AAG3D,SAAK,OAAOD,GACZ,KAAK,UAAUC;AAAA,EACjB;AAxBF,MAAM3L,IAANyL;AAoIA,EAAA3L,GAAsBC,GAAgBC,CAAM;AAM5C,QAAMmM,KAAN,MAAMA,WAAwBpM,EAAe;AAAA;AAAA;AAAA;AAAA;AAAA,IAmD3C,YAAYqM,GAAc;AACxB,YAAK;AAlDP;AAAA,MAAAR,GAAA,MAAAS;AAoDM,UAAArM,EAAO,SAASoM,CAAY,GAAG;AACjC,YAAI,CAACA,EAAa;AAChB,gBAAM,IAAI,UAAU,oBAAoB;AAG1C,QAAAE,GAAA,MAAKD,GAAUrM,EAAO;AAAA,UACpBoM;AAAA,UACA,IAAIpM,EAAOoM,EAAa,MAAMA,EAAa,IAAI;AAAA,QACxD;AAAA,MACK,WAAW,OAAO,UAAUA,CAAY,KAAKA,KAAgB;AAC3D,QAAAE,GAAA,MAAKD,GAAU,IAAIrM,EAAOoM,GAAcA,CAAY;AAAA,eAEpDE,GAAA,MAAKD,GAAU,IAAIrM,EAAOoM,CAAY,IAElC,CAAC,KAAK;AACR,cAAM,IAAI,UAAU,oBAAoB;AAAA,IAG9C;AAAA,IApEA,IAAI,OAAO;AACT,aAAOG,EAAA,MAAKF,GAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,OAAO;AACT,aAAOE,EAAA,MAAKF,GAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,UAAU;AACZ,aAAOE,EAAA,MAAKF,GAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO,KAAK;AAAA,IACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASA,OAAO,kBAAkBpM,GAAO;AAC9B,aAAOD,EAAO,SAASC,CAAK,KAAKA,EAAM,cAAc;AAAA,IACvD;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,OAAO,MAAMmM,GAAc;AACzB,aAAO,IAAI,KAAKA,CAAY;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,OAAO,KAAKA,GAAc;AACxB,aAAO,IAAI,KAAKA,CAAY,EAAE,KAAK,CAAC;AAAA,IACtC;AAAA,IA6BA,QAAQ;AACN,YAAMrO,IAAS,IAAIoO,GAAgB,KAAK,YAAY;AAEpD,iBAAW,CAACvI,GAAK0H,GAAKrL,CAAK,KAAK,KAAK;AACnC,QAAAlC,EAAO,IAAI6F,GAAK0H,GAAKrL,CAAK;AAG5B,aAAOlC;AAAA,IACT;AAAA,IAEA,WAAW;AACT,aAAO,IAAIiC,EAAO,IAAI;AAAA,IACxB;AAAA,IAEA,IAAIgL,GAAUC,GAAa;AACzB,aAAOsB,EAAA,MAAKF,GAAQ,IAAIrB,GAAUC,CAAW;AAAA,IAC/C;AAAA,IACA,IAAID,GAAUC,GAAahL,GAAO;AAEhC,aAAAsM,EAAA,MAAKF,GAAQ,IAAIrB,GAAUC,GAAahL,CAAK,GAC7CsM,EAAA,MAAKF,GAAQ,IAAIpB,GAAaD,GAAU/K,CAAK,GAEtC;AAAA,IACT;AAAA,IAEA,YAAYG,GAAO;AAEjB,aAAAmM,EAAA,MAAKF,GAAQ,UAAUjM,CAAK,GAC5BmM,EAAA,MAAKF,GAAQ,aAAajM,CAAK,GAExB;AAAA,IACT;AAAA,IAEA,SAASA,GAAOmB,GAAO;AACrB,MAAIA,MAAU,WACZA,IAAQnB,GACRA,IAAQ,KAAK;AAGf,YAAMwD,IAAMrC,EAAM,MAAK;AACvB,aAAAqC,EAAI,OAAOxD,GAAO,CAAC,GAEnBmM,EAAA,MAAKF,GAAQ,OAAOjM,GAAOwD,CAAG,GAC9B2I,EAAA,MAAKF,GAAQ,UAAUjM,GAAOmB,CAAK,GAE5B;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKA,UAAUiL,GAAM;AACd,UAAIA,EAAK,WAAW,KAAK;AACvB,cAAM,IAAI,WAAW,yCAAyC;AAKhE,YAAMC,IAAgB,CAAA;AACtB,iBAAW,CAACrM,GAAOsM,CAAY,KAAKF,EAAK,QAAO;AAC9C,QAAIE,KACJD,EAAc,KAAKrM,CAAK;AAG1B,MAAAqM,EAAc,QAAO;AAGrB,iBAAWE,KAAaF;AACtB,aAAK,YAAYE,CAAS;AAG5B,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAoBA,YAAY;AACV,YAAM,EAAE,cAAAP,EAAY,IAAK,MAGnBQ,IAAU,IAAI,MAAOR,KAAgBA,IAAe,KAAM,CAAC;AACjE,eAASd,IAAM,GAAG1H,IAAM,GAAGxD,IAAQ,GAAGA,IAAQwM,EAAQ,QAAQxM;AAC5D,QAAAwM,EAAQxM,CAAK,IAAI,KAAK,IAAIwD,GAAK0H,CAAG,GAE9B,EAAEA,KAAOc,MAAcd,IAAM,EAAE1H;AAGrC,aAAOgJ;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,OAAO,YAAYA,GAAS;AAC1B,YAAMC,IAAcD,EAAQ,QAItBR,KAAgB,KAAK,KAAK,IAAIS,IAAc,CAAC,IAAI,KAAK;AAE5D,UAAI,CAAC,OAAO,UAAUT,CAAY;AAChC,cAAM,IAAI;AAAA,UACR,qEAAqE,KAAK;AAAA,YACxEQ;AAAA,UACX,CAAU;AAAA,QACV;AAGK,YAAM7O,IAAS,IAAIoO,GAAgBC,CAAY;AAC/C,eAASd,IAAM,GAAG1H,IAAM,GAAGxD,IAAQ,GAAGA,IAAQyM,GAAazM;AACzD,QAAArC,EAAO,IAAIuN,GAAK1H,GAAKgJ,EAAQxM,CAAK,CAAC,GAC/B,EAAEkL,KAAOc,MAAcd,IAAM,EAAE1H;AAGrC,aAAO7F;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,CAAC,oBAAoB;AACnB,eAAS6F,IAAM,GAAG0H,IAAM,GAAG1H,IAAM,KAAK,cAAc,QAAQ;AAC1D,cAAM3D,IAAQ,KAAK,IAAI2D,GAAK0H,CAAG;AAE/B,cAAM,CAAC1H,GAAK0H,GAAKrL,CAAK,GAGlB,EAAEqL,KAAO,KAAK,iBAAcA,IAAM,EAAE1H;AAAA,MAC1C;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,CAAC,mBAAmB;AAClB,eAASA,IAAM,GAAG0H,IAAM,GAAG1H,IAAM,KAAK,cAAc;AAGlD,cAFc,KAAK,IAAIA,GAAK0H,CAAG,GAK3B,EAAEA,KAAO,KAAK,iBAAcA,IAAM,EAAE1H;AAAA,IAE5C;AAAA,EACH;AA/OG,EAAAyI,IAAA;AAFF,MAAMS,KAANX;AAkPA,EAAAW,GAAgB,UAAU,YAAY;AAAA,EAEtC,MAAMC,WAAuBD,GAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQ3C,OAAO,iBAAiB7M,GAAO;AAC7B,aACE6M,GAAgB,kBAAkB7M,CAAK,KACvCA,EAAM,iBAAiB;AAAA,IAE3B;AAAA,IAEA,YAAY+M,GAAU;AAGpB,UAFA,MAAMA,CAAQ,GAEV,CAAC,KAAK;AACR,cAAM,IAAI,UAAU,oDAAoD;AAAA,IAE5E;AAAA,IAEA,IAAIhC,GAAUC,GAAahL,GAAO;AAEhC,aAAI+K,MAAaC,MAAahL,IAAQ,IAE/B,MAAM,IAAI+K,GAAUC,GAAahL,CAAK;AAAA,IAC/C;AAAA,IAEA,SAASG,GAAOmB,GAAO;AACrB,aAAIA,MAAU,WACZA,IAAQnB,GACRA,IAAQ,KAAK,eAIfmB,IAAQA,EAAM,MAAK,GACnBA,EAAMnB,CAAK,IAAI,GAER,MAAM,SAASA,GAAOmB,CAAK;AAAA,IACpC;AAAA,IAEA,oBAAoB;AAClB,aAAO,IAAIuL,GAAgB,IAAI;AAAA,IACjC;AAAA,IAEA,QAAQ;AACN,YAAM/O,IAAS,IAAIgP,GAAe,KAAK,YAAY;AAEnD,iBAAW,CAACnJ,GAAK0H,GAAKrL,CAAK,KAAK,KAAK;AACnC,QAAI2D,MAAQ0H,KACZvN,EAAO,IAAI6F,GAAK0H,GAAKrL,CAAK;AAG5B,aAAOlC;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAqBA,YAAY;AACV,YAAM,EAAE,cAAAqO,EAAY,IAAK,MACnBa,KAAkBb,IAAe,KAAKA,IAAgB,GAGtDQ,IAAU,IAAI,MAAMK,CAAa;AACvC,eAAS3B,IAAM,GAAG1H,IAAM,GAAGxD,IAAQ,GAAGA,IAAQwM,EAAQ,QAAQxM;AAC5D,QAAAwM,EAAQxM,CAAK,IAAI,KAAK,IAAIwD,GAAK0H,CAAG,GAE9B,EAAEA,KAAOc,MAAcd,IAAM,EAAE1H,IAAM;AAG3C,aAAOgJ;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKA,OAAO,YAAYA,GAAS;AAC1B,YAAMC,IAAcD,EAAQ;AAE5B,UAAIC,MAAgB;AAClB,eAAO,IAAI,KAAK,CAAC;AAMnB,YAAMT,KAAgB,KAAK,KAAK,IAAIS,IAAc,CAAC,IAAI,KAAK;AAE5D,UAAI,CAAC,OAAO,UAAUT,CAAY;AAChC,cAAM,IAAI;AAAA,UACR,mEAAmE,KAAK;AAAA,YACtEQ;AAAA,UACX,CAAU;AAAA,QACV;AAGK,YAAM7O,IAAS,IAAI,KAAKqO,CAAY;AACpC,eAASd,IAAM,GAAG1H,IAAM,GAAGxD,IAAQ,GAAGA,IAAQyM,GAAazM;AACzD,QAAArC,EAAO,IAAIuN,GAAK1H,GAAKgJ,EAAQxM,CAAK,CAAC,GAC/B,EAAEkL,KAAOc,MAAcd,IAAM,EAAE1H,IAAM;AAG3C,aAAO7F;AAAA,IACT;AAAA,EACH;AACC,EAAAgP,GAAe,UAAU,eAAe;AAAA,EAExC,MAAMG,WAAiBnN,EAAe;AAAA,IACpC,YAAYhC,GAAQe,GAAMC,GAAS;AACjC,YAAK,GACL,KAAK,SAAShB,GACd,KAAK,OAAOe,GACZ,KAAK,UAAUC;AAAA,IACjB;AAAA,EACH;AAAA,EAEC,MAAMoO,WAAyBD,GAAS;AAAA,IACtC,YAAYnP,GAAQ8F,GAAQ;AAC1B,MAAAtD,EAAiBxC,GAAQ8F,CAAM,GAC/B,MAAM9F,GAAQA,EAAO,MAAM,CAAC,GAC5B,KAAK,SAAS8F;AAAA,IAChB;AAAA,IAEA,IAAImH,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO,IAAI+K,GAAU,KAAK,QAAQ/K,CAAK,GACrC;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAU;AACZ,aAAO,KAAK,OAAO,IAAIA,GAAU,KAAK,MAAM;AAAA,IAC9C;AAAA,EACH;AAAA,EAEC,MAAMoC,WAAkCF,GAAS;AAAA,IAC/C,YAAYnP,GAAQ+C,GAAe;AACjC,MAAAD,GAAmB9C,GAAQ+C,CAAa,GACxC,MAAM/C,GAAQA,EAAO,MAAM+C,EAAc,MAAM,GAC/C,KAAK,gBAAgBA;AAAA,IACvB;AAAA,IAEA,IAAIkK,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO,IAAI+K,GAAU,KAAK,cAAcC,CAAW,GAAGhL,CAAK,GACzD;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,OAAO,IAAID,GAAU,KAAK,cAAcC,CAAW,CAAC;AAAA,IAClE;AAAA,EACH;AAAA,EAEC,MAAMoC,WAA6BH,GAAS;AAAA,IAC1C,YAAYnP,GAAQ;AAClB,YAAMA,GAAQA,EAAO,MAAMA,EAAO,OAAO;AAAA,IAC3C;AAAA,IAEA,IAAIiN,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO,IAAI+K,GAAU,KAAK,UAAUC,IAAc,GAAGhL,CAAK,GACxD;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,OAAO,IAAID,GAAU,KAAK,UAAUC,IAAc,CAAC;AAAA,IACjE;AAAA,EACH;AAAA,EAEC,MAAMqC,WAA0BJ,GAAS;AAAA,IACvC,YAAYnP,GAAQ;AAClB,YAAMA,GAAQA,EAAO,MAAMA,EAAO,OAAO;AAAA,IAC3C;AAAA,IAEA,IAAIiN,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO,IAAI,KAAK,OAAO+K,IAAW,GAAGC,GAAahL,CAAK,GACrD;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,OAAO,IAAI,KAAK,OAAOD,IAAW,GAAGC,CAAW;AAAA,IAC9D;AAAA,EACH;AAAA,EAEC,MAAMsC,WAAsBL,GAAS;AAAA,IACnC,YAAYnP,GAAQ6F,GAAK;AACvB,MAAAzD,EAAcpC,GAAQ6F,CAAG,GACzB,MAAM7F,GAAQ,GAAGA,EAAO,OAAO,GAC/B,KAAK,MAAM6F;AAAA,IACb;AAAA,IAEA,IAAIoH,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO,IAAI,KAAK,KAAKgL,GAAahL,CAAK,GACrC;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,OAAO,IAAI,KAAK,KAAKA,CAAW;AAAA,IAC9C;AAAA,EACH;AAAA,EAEC,MAAMuC,WAA+BN,GAAS;AAAA,IAC5C,YAAYnP,GAAQ6C,GAAY;AAC9B,MAAAD,GAAgB5C,GAAQ6C,CAAU,GAClC,MAAM7C,GAAQ6C,EAAW,QAAQ7C,EAAO,OAAO,GAC/C,KAAK,aAAa6C;AAAA,IACpB;AAAA,IAEA,IAAIoK,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO,IAAI,KAAK,WAAW+K,CAAQ,GAAGC,GAAahL,CAAK,GACtD;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,OAAO,IAAI,KAAK,WAAWD,CAAQ,GAAGC,CAAW;AAAA,IAC/D;AAAA,EACH;AAAA,EAEC,MAAMwC,WAA4BP,GAAS;AAAA,IACzC,YAAYnP,GAAQ6C,GAAYE,GAAe;AAC7C,MAAAH,GAAgB5C,GAAQ6C,CAAU,GAClCC,GAAmB9C,GAAQ+C,CAAa,GACxC,MAAM/C,GAAQ6C,EAAW,QAAQE,EAAc,MAAM,GACrD,KAAK,aAAaF,GAClB,KAAK,gBAAgBE;AAAA,IACvB;AAAA,IAEA,IAAIkK,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO;AAAA,QACV,KAAK,WAAW+K,CAAQ;AAAA,QACxB,KAAK,cAAcC,CAAW;AAAA,QAC9BhL;AAAA,MACP,GACY;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,OAAO;AAAA,QACjB,KAAK,WAAWD,CAAQ;AAAA,QACxB,KAAK,cAAcC,CAAW;AAAA,MACrC;AAAA,IACG;AAAA,EACH;AAAA,EAEC,MAAMyC,WAAsBR,GAAS;AAAA,IACnC,YAAYnP,GAAQiD,GAAUC,GAAQC,GAAaC,GAAW;AAC5D,MAAAJ,GAAWhD,GAAQiD,GAAUC,GAAQC,GAAaC,CAAS,GAC3D,MAAMpD,GAAQkD,IAASD,IAAW,GAAGG,IAAYD,IAAc,CAAC,GAChE,KAAK,WAAWF,GAChB,KAAK,cAAcE;AAAA,IACrB;AAAA,IAEA,IAAI8J,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO;AAAA,QACV,KAAK,WAAW+K;AAAA,QAChB,KAAK,cAAcC;AAAA,QACnBhL;AAAA,MACP,GACY;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,OAAO;AAAA,QACjB,KAAK,WAAWD;AAAA,QAChB,KAAK,cAAcC;AAAA,MAC1B;AAAA,IACG;AAAA,EACH;AAAA,EAEC,MAAM0C,WAA4BT,GAAS;AAAA,IACzC,YAAYnP,GAAQ;AAClB,YAAMA,GAAQA,EAAO,SAASA,EAAO,IAAI;AAAA,IAC3C;AAAA,IAEA,IAAIiN,GAAUC,GAAahL,GAAO;AAChC,kBAAK,OAAO,IAAIgL,GAAaD,GAAU/K,CAAK,GACrC;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,OAAO,IAAIA,GAAaD,CAAQ;AAAA,IAC9C;AAAA,EACH;AAAA,EAEC,MAAM4C,WAAwB7N,EAAe;AAAA,IAC3C,YAAYkE,GAAMzF,IAAU,IAAI;AAC9B,YAAM,EAAE,MAAAM,IAAO,EAAC,IAAKN;AAErB,UAAIyF,EAAK,SAASnF,MAAS;AACzB,cAAM,IAAI,MAAM,wDAAwD;AAE1E,YAAK,GACL,KAAK,OAAOA,GACZ,KAAK,UAAUmF,EAAK,SAASnF,GAC7B,KAAK,OAAOmF;AAAA,IACd;AAAA,IAEA,IAAI+G,GAAUC,GAAahL,GAAO;AAChC,UAAIG,IAAQ,KAAK,gBAAgB4K,GAAUC,CAAW;AACtD,kBAAK,KAAK7K,CAAK,IAAIH,GACZ;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,UAAI7K,IAAQ,KAAK,gBAAgB4K,GAAUC,CAAW;AACtD,aAAO,KAAK,KAAK7K,CAAK;AAAA,IACxB;AAAA,IAEA,gBAAgBwD,GAAKC,GAAQ;AAC3B,aAAOD,IAAM,KAAK,UAAUC;AAAA,IAC9B;AAAA,EACH;AAAA,EAEC,MAAMgK,UAAwB9N,EAAe;AAAA,IAC3C,YAAYkE,GAAM;AAChB,YAAK,GACL,KAAK,OAAOA,GACZ,KAAK,OAAOA,EAAK,QACjB,KAAK,UAAUA,EAAK,CAAC,EAAE;AAAA,IACzB;AAAA,IAEA,IAAI+G,GAAUC,GAAahL,GAAO;AAChC,kBAAK,KAAK+K,CAAQ,EAAEC,CAAW,IAAIhL,GAC5B;AAAA,IACT;AAAA,IAEA,IAAI+K,GAAUC,GAAa;AACzB,aAAO,KAAK,KAAKD,CAAQ,EAAEC,CAAW;AAAA,IACxC;AAAA,EACH;AAEC,WAAS6C,GAAKvM,GAAO/C,GAAS;AAC5B,QAAIR,EAAW,WAAWuD,CAAK;AAC7B,aAAIA,EAAM,CAAC,KAAKvD,EAAW,WAAWuD,EAAM,CAAC,CAAC,IACrC,IAAIsM,EAAgBtM,CAAK,IAEzB,IAAIqM,GAAgBrM,GAAO/C,CAAO;AAG3C,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAElD;AAAA,EAEA,MAAMuP,GAAgB;AAAA,IACpB,YAAYhQ,GAAQ;AAClB,MAAAA,IAAS8P,EAAgB,YAAY9P,CAAM;AAE3C,UAAIiQ,IAAKjQ,EAAO,MAAK,GACjBe,IAAOkP,EAAG,MACVjP,IAAUiP,EAAG,SACbC,IAAc,IAAI,aAAanP,CAAI,GACnCoP,IAAY,GACZ9O,GAAGC,GAAGsF,GAAGO,GAAGgB,GAAGiI,GAAGrM,GAClBsM,GAAQC;AAEZ,WAAKjP,IAAI,GAAGA,IAAIN,GAAMM;AACpB,QAAA6O,EAAY7O,CAAC,IAAIA;AAKnB,WAFAgP,IAAS,IAAI,aAAatP,CAAI,GAEzBO,IAAI,GAAGA,IAAIN,GAASM,KAAK;AAC5B,aAAKD,IAAI,GAAGA,IAAIN,GAAMM;AACpB,UAAAgP,EAAOhP,CAAC,IAAI4O,EAAG,IAAI5O,GAAGC,CAAC;AAGzB,aAAKD,IAAI,GAAGA,IAAIN,GAAMM,KAAK;AAGzB,eAFAiP,IAAO,KAAK,IAAIjP,GAAGC,CAAC,GACpB6G,IAAI,GACCvB,IAAI,GAAGA,IAAI0J,GAAM1J;AACpB,YAAAuB,KAAK8H,EAAG,IAAI5O,GAAGuF,CAAC,IAAIyJ,EAAOzJ,CAAC;AAE9B,UAAAyJ,EAAOhP,CAAC,KAAK8G,GACb8H,EAAG,IAAI5O,GAAGC,GAAG+O,EAAOhP,CAAC,CAAC;AAAA,QACxB;AAGA,aADA8F,IAAI7F,GACCD,IAAIC,IAAI,GAAGD,IAAIN,GAAMM;AACxB,UAAI,KAAK,IAAIgP,EAAOhP,CAAC,CAAC,IAAI,KAAK,IAAIgP,EAAOlJ,CAAC,CAAC,MAC1CA,IAAI9F;AAIR,YAAI8F,MAAM7F,GAAG;AACX,eAAKsF,IAAI,GAAGA,IAAI5F,GAAS4F;AACvB,YAAAwJ,IAAIH,EAAG,IAAI9I,GAAGP,CAAC,GACfqJ,EAAG,IAAI9I,GAAGP,GAAGqJ,EAAG,IAAI3O,GAAGsF,CAAC,CAAC,GACzBqJ,EAAG,IAAI3O,GAAGsF,GAAGwJ,CAAC;AAGhB,UAAArM,IAAImM,EAAY/I,CAAC,GACjB+I,EAAY/I,CAAC,IAAI+I,EAAY5O,CAAC,GAC9B4O,EAAY5O,CAAC,IAAIyC,GAEjBoM,IAAY,CAACA;AAAA,QACf;AAEA,YAAI7O,IAAIP,KAAQkP,EAAG,IAAI3O,GAAGA,CAAC,MAAM;AAC/B,eAAKD,IAAIC,IAAI,GAAGD,IAAIN,GAAMM;AACxB,YAAA4O,EAAG,IAAI5O,GAAGC,GAAG2O,EAAG,IAAI5O,GAAGC,CAAC,IAAI2O,EAAG,IAAI3O,GAAGA,CAAC,CAAC;AAAA,MAG9C;AAEA,WAAK,KAAK2O,GACV,KAAK,cAAcC,GACnB,KAAK,YAAYC;AAAA,IACnB;AAAA,IAEA,aAAa;AACX,UAAIjK,IAAO,KAAK,IACZqH,IAAMrH,EAAK;AACf,eAAS5E,IAAI,GAAGA,IAAIiM,GAAKjM;AACvB,YAAI4E,EAAK,IAAI5E,GAAGA,CAAC,MAAM;AACrB,iBAAO;AAGX,aAAO;AAAA,IACT;AAAA,IAEA,MAAMY,GAAO;AACX,MAAAA,IAAQD,EAAO,YAAYC,CAAK;AAEhC,UAAI+N,IAAK,KAAK;AAGd,UAFWA,EAAG,SAED/N,EAAM;AACjB,cAAM,IAAI,MAAM,2BAA2B;AAE7C,UAAI,KAAK;AACP,cAAM,IAAI,MAAM,uBAAuB;AAGzC,UAAIqO,IAAQrO,EAAM,SACdsO,IAAItO,EAAM,aAAa,KAAK,aAAa,GAAGqO,IAAQ,CAAC,GACrDvP,IAAUiP,EAAG,SACb5O,GAAGC,GAAGsF;AAEV,WAAKA,IAAI,GAAGA,IAAI5F,GAAS4F;AACvB,aAAKvF,IAAIuF,IAAI,GAAGvF,IAAIL,GAASK;AAC3B,eAAKC,IAAI,GAAGA,IAAIiP,GAAOjP;AACrB,YAAAkP,EAAE,IAAInP,GAAGC,GAAGkP,EAAE,IAAInP,GAAGC,CAAC,IAAIkP,EAAE,IAAI5J,GAAGtF,CAAC,IAAI2O,EAAG,IAAI5O,GAAGuF,CAAC,CAAC;AAI1D,WAAKA,IAAI5F,IAAU,GAAG4F,KAAK,GAAGA,KAAK;AACjC,aAAKtF,IAAI,GAAGA,IAAIiP,GAAOjP;AACrB,UAAAkP,EAAE,IAAI5J,GAAGtF,GAAGkP,EAAE,IAAI5J,GAAGtF,CAAC,IAAI2O,EAAG,IAAIrJ,GAAGA,CAAC,CAAC;AAExC,aAAKvF,IAAI,GAAGA,IAAIuF,GAAGvF;AACjB,eAAKC,IAAI,GAAGA,IAAIiP,GAAOjP;AACrB,YAAAkP,EAAE,IAAInP,GAAGC,GAAGkP,EAAE,IAAInP,GAAGC,CAAC,IAAIkP,EAAE,IAAI5J,GAAGtF,CAAC,IAAI2O,EAAG,IAAI5O,GAAGuF,CAAC,CAAC;AAAA,MAG1D;AACA,aAAO4J;AAAA,IACT;AAAA,IAEA,IAAI,cAAc;AAChB,UAAItK,IAAO,KAAK;AAChB,UAAI,CAACA,EAAK;AACR,cAAM,IAAI,MAAM,uBAAuB;AAEzC,UAAIuK,IAAc,KAAK,WACnBlD,IAAMrH,EAAK;AACf,eAAS5E,IAAI,GAAGA,IAAIiM,GAAKjM;AACvB,QAAAmP,KAAevK,EAAK,IAAI5E,GAAGA,CAAC;AAE9B,aAAOmP;AAAA,IACT;AAAA,IAEA,IAAI,wBAAwB;AAC1B,UAAIvK,IAAO,KAAK,IACZnF,IAAOmF,EAAK,MACZlF,IAAUkF,EAAK,SACfsK,IAAI,IAAIvO,EAAOlB,GAAMC,CAAO;AAChC,eAASK,IAAI,GAAGA,IAAIN,GAAMM;AACxB,iBAASC,IAAI,GAAGA,IAAIN,GAASM;AAC3B,UAAID,IAAIC,IACNkP,EAAE,IAAInP,GAAGC,GAAG4E,EAAK,IAAI7E,GAAGC,CAAC,CAAC,IACjBD,MAAMC,IACfkP,EAAE,IAAInP,GAAGC,GAAG,CAAC,IAEbkP,EAAE,IAAInP,GAAGC,GAAG,CAAC;AAInB,aAAOkP;AAAA,IACT;AAAA,IAEA,IAAI,wBAAwB;AAC1B,UAAItK,IAAO,KAAK,IACZnF,IAAOmF,EAAK,MACZlF,IAAUkF,EAAK,SACfsK,IAAI,IAAIvO,EAAOlB,GAAMC,CAAO;AAChC,eAASK,IAAI,GAAGA,IAAIN,GAAMM;AACxB,iBAASC,IAAI,GAAGA,IAAIN,GAASM;AAC3B,UAAID,KAAKC,IACPkP,EAAE,IAAInP,GAAGC,GAAG4E,EAAK,IAAI7E,GAAGC,CAAC,CAAC,IAE1BkP,EAAE,IAAInP,GAAGC,GAAG,CAAC;AAInB,aAAOkP;AAAA,IACT;AAAA,IAEA,IAAI,yBAAyB;AAC3B,aAAO,MAAM,KAAK,KAAK,WAAW;AAAA,IACpC;AAAA,EACH;AAEC,WAASE,GAAWtE,GAAGC,GAAG;AACxB,QAAIL,IAAI;AACR,WAAI,KAAK,IAAII,CAAC,IAAI,KAAK,IAAIC,CAAC,KAC1BL,IAAIK,IAAID,GACD,KAAK,IAAIA,CAAC,IAAI,KAAK,KAAK,IAAIJ,IAAIA,CAAC,KAEtCK,MAAM,KACRL,IAAII,IAAIC,GACD,KAAK,IAAIA,CAAC,IAAI,KAAK,KAAK,IAAIL,IAAIA,CAAC,KAEnC;AAAA,EACT;AAAA,EAEA,MAAM2E,GAAgB;AAAA,IACpB,YAAYzO,GAAO;AACjB,MAAAA,IAAQ4N,EAAgB,YAAY5N,CAAK;AAEzC,UAAI0O,IAAK1O,EAAM,MAAK,GAChB+E,IAAI/E,EAAM,MACVgF,IAAIhF,EAAM,SACV2O,IAAQ,IAAI,aAAa3J,CAAC,GAC1B7F,GAAGC,GAAGsF,GAAGuB;AAEb,WAAKvB,IAAI,GAAGA,IAAIM,GAAGN,KAAK;AACtB,YAAIkK,IAAM;AACV,aAAKzP,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACjB,UAAAyP,IAAMJ,GAAWI,GAAKF,EAAG,IAAIvP,GAAGuF,CAAC,CAAC;AAEpC,YAAIkK,MAAQ,GAAG;AAIb,eAHIF,EAAG,IAAIhK,GAAGA,CAAC,IAAI,MACjBkK,IAAM,CAACA,IAEJzP,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACjB,YAAAuP,EAAG,IAAIvP,GAAGuF,GAAGgK,EAAG,IAAIvP,GAAGuF,CAAC,IAAIkK,CAAG;AAGjC,eADAF,EAAG,IAAIhK,GAAGA,GAAGgK,EAAG,IAAIhK,GAAGA,CAAC,IAAI,CAAC,GACxBtF,IAAIsF,IAAI,GAAGtF,IAAI4F,GAAG5F,KAAK;AAE1B,iBADA6G,IAAI,GACC9G,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACjB,cAAA8G,KAAKyI,EAAG,IAAIvP,GAAGuF,CAAC,IAAIgK,EAAG,IAAIvP,GAAGC,CAAC;AAGjC,iBADA6G,IAAI,CAACA,IAAIyI,EAAG,IAAIhK,GAAGA,CAAC,GACfvF,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACjB,cAAAuP,EAAG,IAAIvP,GAAGC,GAAGsP,EAAG,IAAIvP,GAAGC,CAAC,IAAI6G,IAAIyI,EAAG,IAAIvP,GAAGuF,CAAC,CAAC;AAAA,UAEhD;AAAA,QACF;AACA,QAAAiK,EAAMjK,CAAC,IAAI,CAACkK;AAAA,MACd;AAEA,WAAK,KAAKF,GACV,KAAK,QAAQC;AAAA,IACf;AAAA,IAEA,MAAM3O,GAAO;AACX,MAAAA,IAAQD,EAAO,YAAYC,CAAK;AAEhC,UAAI0O,IAAK,KAAK,IACV3J,IAAI2J,EAAG;AAEX,UAAI1O,EAAM,SAAS+E;AACjB,cAAM,IAAI,MAAM,kCAAkC;AAEpD,UAAI,CAAC,KAAK;AACR,cAAM,IAAI,MAAM,0BAA0B;AAG5C,UAAIsJ,IAAQrO,EAAM,SACdsO,IAAItO,EAAM,MAAK,GACf,IAAI0O,EAAG,SACPvP,GAAGC,GAAGsF,GAAGuB;AAEb,WAAKvB,IAAI,GAAGA,IAAI,GAAGA;AACjB,aAAKtF,IAAI,GAAGA,IAAIiP,GAAOjP,KAAK;AAE1B,eADA6G,IAAI,GACC9G,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACjB,YAAA8G,KAAKyI,EAAG,IAAIvP,GAAGuF,CAAC,IAAI4J,EAAE,IAAInP,GAAGC,CAAC;AAGhC,eADA6G,IAAI,CAACA,IAAIyI,EAAG,IAAIhK,GAAGA,CAAC,GACfvF,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACjB,YAAAmP,EAAE,IAAInP,GAAGC,GAAGkP,EAAE,IAAInP,GAAGC,CAAC,IAAI6G,IAAIyI,EAAG,IAAIvP,GAAGuF,CAAC,CAAC;AAAA,QAE9C;AAEF,WAAKA,IAAI,IAAI,GAAGA,KAAK,GAAGA,KAAK;AAC3B,aAAKtF,IAAI,GAAGA,IAAIiP,GAAOjP;AACrB,UAAAkP,EAAE,IAAI5J,GAAGtF,GAAGkP,EAAE,IAAI5J,GAAGtF,CAAC,IAAI,KAAK,MAAMsF,CAAC,CAAC;AAEzC,aAAKvF,IAAI,GAAGA,IAAIuF,GAAGvF;AACjB,eAAKC,IAAI,GAAGA,IAAIiP,GAAOjP;AACrB,YAAAkP,EAAE,IAAInP,GAAGC,GAAGkP,EAAE,IAAInP,GAAGC,CAAC,IAAIkP,EAAE,IAAI5J,GAAGtF,CAAC,IAAIsP,EAAG,IAAIvP,GAAGuF,CAAC,CAAC;AAAA,MAG1D;AAEA,aAAO4J,EAAE,UAAU,GAAG,IAAI,GAAG,GAAGD,IAAQ,CAAC;AAAA,IAC3C;AAAA,IAEA,aAAa;AACX,UAAIvP,IAAU,KAAK,GAAG;AACtB,eAASK,IAAI,GAAGA,IAAIL,GAASK;AAC3B,YAAI,KAAK,MAAMA,CAAC,MAAM;AACpB,iBAAO;AAGX,aAAO;AAAA,IACT;AAAA,IAEA,IAAI,wBAAwB;AAC1B,UAAIuP,IAAK,KAAK,IACV1J,IAAI0J,EAAG,SACPJ,IAAI,IAAIvO,EAAOiF,GAAGA,CAAC,GACnB7F,GAAGC;AACP,WAAKD,IAAI,GAAGA,IAAI6F,GAAG7F;AACjB,aAAKC,IAAI,GAAGA,IAAI4F,GAAG5F;AACjB,UAAID,IAAIC,IACNkP,EAAE,IAAInP,GAAGC,GAAGsP,EAAG,IAAIvP,GAAGC,CAAC,CAAC,IACfD,MAAMC,IACfkP,EAAE,IAAInP,GAAGC,GAAG,KAAK,MAAMD,CAAC,CAAC,IAEzBmP,EAAE,IAAInP,GAAGC,GAAG,CAAC;AAInB,aAAOkP;AAAA,IACT;AAAA,IAEA,IAAI,mBAAmB;AACrB,UAAII,IAAK,KAAK,IACV7P,IAAO6P,EAAG,MACV5P,IAAU4P,EAAG,SACbJ,IAAI,IAAIvO,EAAOlB,GAAMC,CAAO,GAC5BK,GAAGC,GAAGsF,GAAGuB;AAEb,WAAKvB,IAAI5F,IAAU,GAAG4F,KAAK,GAAGA,KAAK;AACjC,aAAKvF,IAAI,GAAGA,IAAIN,GAAMM;AACpB,UAAAmP,EAAE,IAAInP,GAAGuF,GAAG,CAAC;AAGf,aADA4J,EAAE,IAAI5J,GAAGA,GAAG,CAAC,GACRtF,IAAIsF,GAAGtF,IAAIN,GAASM;AACvB,cAAIsP,EAAG,IAAIhK,GAAGA,CAAC,MAAM,GAAG;AAEtB,iBADAuB,IAAI,GACC9G,IAAIuF,GAAGvF,IAAIN,GAAMM;AACpB,cAAA8G,KAAKyI,EAAG,IAAIvP,GAAGuF,CAAC,IAAI4J,EAAE,IAAInP,GAAGC,CAAC;AAKhC,iBAFA6G,IAAI,CAACA,IAAIyI,EAAG,IAAIhK,GAAGA,CAAC,GAEfvF,IAAIuF,GAAGvF,IAAIN,GAAMM;AACpB,cAAAmP,EAAE,IAAInP,GAAGC,GAAGkP,EAAE,IAAInP,GAAGC,CAAC,IAAI6G,IAAIyI,EAAG,IAAIvP,GAAGuF,CAAC,CAAC;AAAA,UAE9C;AAAA,MAEJ;AACA,aAAO4J;AAAA,IACT;AAAA,EACH;AAAA,EAEC,MAAMO,GAA2B;AAAA,IAC/B,YAAY7O,GAAOzB,IAAU,IAAI;AAG/B,UAFAyB,IAAQ4N,EAAgB,YAAY5N,CAAK,GAErCA,EAAM;AACR,cAAM,IAAI,MAAM,0BAA0B;AAG5C,UAAI+E,IAAI/E,EAAM,MACVgF,IAAIhF,EAAM;AAEd,YAAM;AAAA,QACJ,4BAAA8O,IAA6B;AAAA,QAC7B,6BAAAC,IAA8B;AAAA,QAC9B,eAAAC,IAAgB;AAAA,MACvB,IAASzQ;AAEJ,UAAI0Q,IAAQ,EAAQH,GAChBI,IAAQ,EAAQH,GAEhBI,IAAU,IACVjF;AACJ,UAAInF,IAAIC;AACN,YAAI,CAACgK;AACH,UAAA9E,IAAIlK,EAAM,MAAK,GAEf,QAAQ;AAAA,YACN;AAAA,UACX;AAAA,aACc;AACL,UAAAkK,IAAIlK,EAAM,UAAS,GACnB+E,IAAImF,EAAE,MACNlF,IAAIkF,EAAE,SACNiF,IAAU;AACV,cAAIC,IAAMH;AACV,UAAAA,IAAQC,GACRA,IAAQE;AAAA,QACV;AAAA;AAEA,QAAAlF,IAAIlK,EAAM,MAAK;AAGjB,UAAIqP,IAAK,KAAK,IAAItK,GAAGC,CAAC,GAClBsK,IAAK,KAAK,IAAIvK,IAAI,GAAGC,CAAC,GACtBiB,IAAI,IAAI,aAAaqJ,CAAE,GACvBC,IAAI,IAAIxP,EAAOgF,GAAGsK,CAAE,GACpBG,IAAI,IAAIzP,EAAOiF,GAAGA,CAAC,GAEnBoB,IAAI,IAAI,aAAapB,CAAC,GACtByK,IAAO,IAAI,aAAa1K,CAAC,GAEzB2K,IAAK,IAAI,aAAaJ,CAAE;AAC5B,eAASnQ,IAAI,GAAGA,IAAImQ,GAAInQ,IAAK,CAAAuQ,EAAGvQ,CAAC,IAAIA;AAErC,UAAIwQ,IAAM,KAAK,IAAI5K,IAAI,GAAGC,CAAC,GACvB4K,IAAM,KAAK,IAAI,GAAG,KAAK,IAAI5K,IAAI,GAAGD,CAAC,CAAC,GACpC8K,IAAM,KAAK,IAAIF,GAAKC,CAAG;AAE3B,eAASlL,IAAI,GAAGA,IAAImL,GAAKnL,KAAK;AAC5B,YAAIA,IAAIiL,GAAK;AACX,UAAA1J,EAAEvB,CAAC,IAAI;AACP,mBAASvF,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACrB,YAAA8G,EAAEvB,CAAC,IAAI8J,GAAWvI,EAAEvB,CAAC,GAAGwF,EAAE,IAAI/K,GAAGuF,CAAC,CAAC;AAErC,cAAIuB,EAAEvB,CAAC,MAAM,GAAG;AACd,YAAIwF,EAAE,IAAIxF,GAAGA,CAAC,IAAI,MAChBuB,EAAEvB,CAAC,IAAI,CAACuB,EAAEvB,CAAC;AAEb,qBAASvF,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACrB,cAAA+K,EAAE,IAAI/K,GAAGuF,GAAGwF,EAAE,IAAI/K,GAAGuF,CAAC,IAAIuB,EAAEvB,CAAC,CAAC;AAEhC,YAAAwF,EAAE,IAAIxF,GAAGA,GAAGwF,EAAE,IAAIxF,GAAGA,CAAC,IAAI,CAAC;AAAA,UAC7B;AACA,UAAAuB,EAAEvB,CAAC,IAAI,CAACuB,EAAEvB,CAAC;AAAA,QACb;AAEA,iBAAStF,IAAIsF,IAAI,GAAGtF,IAAI4F,GAAG5F,KAAK;AAC9B,cAAIsF,IAAIiL,KAAO1J,EAAEvB,CAAC,MAAM,GAAG;AACzB,gBAAIwJ,IAAI;AACR,qBAAS/O,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACrB,cAAA+O,KAAKhE,EAAE,IAAI/K,GAAGuF,CAAC,IAAIwF,EAAE,IAAI/K,GAAGC,CAAC;AAE/B,YAAA8O,IAAI,CAACA,IAAIhE,EAAE,IAAIxF,GAAGA,CAAC;AACnB,qBAASvF,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACrB,cAAA+K,EAAE,IAAI/K,GAAGC,GAAG8K,EAAE,IAAI/K,GAAGC,CAAC,IAAI8O,IAAIhE,EAAE,IAAI/K,GAAGuF,CAAC,CAAC;AAAA,UAE7C;AACA,UAAA0B,EAAEhH,CAAC,IAAI8K,EAAE,IAAIxF,GAAGtF,CAAC;AAAA,QACnB;AAEA,YAAI6P,KAASvK,IAAIiL;AACf,mBAASxQ,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACrB,YAAAoQ,EAAE,IAAIpQ,GAAGuF,GAAGwF,EAAE,IAAI/K,GAAGuF,CAAC,CAAC;AAI3B,YAAIA,IAAIkL,GAAK;AACX,UAAAxJ,EAAE1B,CAAC,IAAI;AACP,mBAASvF,IAAIuF,IAAI,GAAGvF,IAAI6F,GAAG7F;AACzB,YAAAiH,EAAE1B,CAAC,IAAI8J,GAAWpI,EAAE1B,CAAC,GAAG0B,EAAEjH,CAAC,CAAC;AAE9B,cAAIiH,EAAE1B,CAAC,MAAM,GAAG;AACd,YAAI0B,EAAE1B,IAAI,CAAC,IAAI,MACb0B,EAAE1B,CAAC,IAAI,IAAI0B,EAAE1B,CAAC;AAEhB,qBAASvF,IAAIuF,IAAI,GAAGvF,IAAI6F,GAAG7F;AACzB,cAAAiH,EAAEjH,CAAC,KAAKiH,EAAE1B,CAAC;AAEb,YAAA0B,EAAE1B,IAAI,CAAC,KAAK;AAAA,UACd;AAEA,cADA0B,EAAE1B,CAAC,IAAI,CAAC0B,EAAE1B,CAAC,GACPA,IAAI,IAAIK,KAAKqB,EAAE1B,CAAC,MAAM,GAAG;AAC3B,qBAASvF,IAAIuF,IAAI,GAAGvF,IAAI4F,GAAG5F;AACzB,cAAAsQ,EAAKtQ,CAAC,IAAI;AAEZ,qBAASA,IAAIuF,IAAI,GAAGvF,IAAI4F,GAAG5F;AACzB,uBAASC,IAAIsF,IAAI,GAAGtF,IAAI4F,GAAG5F;AACzB,gBAAAqQ,EAAKtQ,CAAC,KAAKiH,EAAEhH,CAAC,IAAI8K,EAAE,IAAI/K,GAAGC,CAAC;AAGhC,qBAASA,IAAIsF,IAAI,GAAGtF,IAAI4F,GAAG5F,KAAK;AAC9B,kBAAI8O,IAAI,CAAC9H,EAAEhH,CAAC,IAAIgH,EAAE1B,IAAI,CAAC;AACvB,uBAASvF,IAAIuF,IAAI,GAAGvF,IAAI4F,GAAG5F;AACzB,gBAAA+K,EAAE,IAAI/K,GAAGC,GAAG8K,EAAE,IAAI/K,GAAGC,CAAC,IAAI8O,IAAIuB,EAAKtQ,CAAC,CAAC;AAAA,YAEzC;AAAA,UACF;AACA,cAAI+P;AACF,qBAAS/P,IAAIuF,IAAI,GAAGvF,IAAI6F,GAAG7F;AACzB,cAAAqQ,EAAE,IAAIrQ,GAAGuF,GAAG0B,EAAEjH,CAAC,CAAC;AAAA,QAGtB;AAAA,MACF;AAEA,UAAI8F,IAAI,KAAK,IAAID,GAAGD,IAAI,CAAC;AAYzB,UAXI4K,IAAM3K,MACRiB,EAAE0J,CAAG,IAAIzF,EAAE,IAAIyF,GAAKA,CAAG,IAErB5K,IAAIE,MACNgB,EAAEhB,IAAI,CAAC,IAAI,IAET2K,IAAM,IAAI3K,MACZmB,EAAEwJ,CAAG,IAAI1F,EAAE,IAAI0F,GAAK3K,IAAI,CAAC,IAE3BmB,EAAEnB,IAAI,CAAC,IAAI,GAEPgK,GAAO;AACT,iBAAS7P,IAAIuQ,GAAKvQ,IAAIiQ,GAAIjQ,KAAK;AAC7B,mBAASD,IAAI,GAAGA,IAAI4F,GAAG5F;AACrB,YAAAoQ,EAAE,IAAIpQ,GAAGC,GAAG,CAAC;AAEf,UAAAmQ,EAAE,IAAInQ,GAAGA,GAAG,CAAC;AAAA,QACf;AACA,iBAASsF,IAAIiL,IAAM,GAAGjL,KAAK,GAAGA;AAC5B,cAAIuB,EAAEvB,CAAC,MAAM,GAAG;AACd,qBAAStF,IAAIsF,IAAI,GAAGtF,IAAIiQ,GAAIjQ,KAAK;AAC/B,kBAAI8O,IAAI;AACR,uBAAS/O,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACrB,gBAAA+O,KAAKqB,EAAE,IAAIpQ,GAAGuF,CAAC,IAAI6K,EAAE,IAAIpQ,GAAGC,CAAC;AAE/B,cAAA8O,IAAI,CAACA,IAAIqB,EAAE,IAAI7K,GAAGA,CAAC;AACnB,uBAASvF,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACrB,gBAAAoQ,EAAE,IAAIpQ,GAAGC,GAAGmQ,EAAE,IAAIpQ,GAAGC,CAAC,IAAI8O,IAAIqB,EAAE,IAAIpQ,GAAGuF,CAAC,CAAC;AAAA,YAE7C;AACA,qBAASvF,IAAIuF,GAAGvF,IAAI4F,GAAG5F;AACrB,cAAAoQ,EAAE,IAAIpQ,GAAGuF,GAAG,CAAC6K,EAAE,IAAIpQ,GAAGuF,CAAC,CAAC;AAE1B,YAAA6K,EAAE,IAAI7K,GAAGA,GAAG,IAAI6K,EAAE,IAAI7K,GAAGA,CAAC,CAAC;AAC3B,qBAASvF,IAAI,GAAGA,IAAIuF,IAAI,GAAGvF;AACzB,cAAAoQ,EAAE,IAAIpQ,GAAGuF,GAAG,CAAC;AAAA,UAEjB,OAAO;AACL,qBAASvF,IAAI,GAAGA,IAAI4F,GAAG5F;AACrB,cAAAoQ,EAAE,IAAIpQ,GAAGuF,GAAG,CAAC;AAEf,YAAA6K,EAAE,IAAI7K,GAAGA,GAAG,CAAC;AAAA,UACf;AAAA,MAEJ;AAEA,UAAIwK;AACF,iBAASxK,IAAIM,IAAI,GAAGN,KAAK,GAAGA,KAAK;AAC/B,cAAIA,IAAIkL,KAAOxJ,EAAE1B,CAAC,MAAM;AACtB,qBAAStF,IAAIsF,IAAI,GAAGtF,IAAI4F,GAAG5F,KAAK;AAC9B,kBAAI8O,IAAI;AACR,uBAAS/O,IAAIuF,IAAI,GAAGvF,IAAI6F,GAAG7F;AACzB,gBAAA+O,KAAKsB,EAAE,IAAIrQ,GAAGuF,CAAC,IAAI8K,EAAE,IAAIrQ,GAAGC,CAAC;AAE/B,cAAA8O,IAAI,CAACA,IAAIsB,EAAE,IAAI9K,IAAI,GAAGA,CAAC;AACvB,uBAASvF,IAAIuF,IAAI,GAAGvF,IAAI6F,GAAG7F;AACzB,gBAAAqQ,EAAE,IAAIrQ,GAAGC,GAAGoQ,EAAE,IAAIrQ,GAAGC,CAAC,IAAI8O,IAAIsB,EAAE,IAAIrQ,GAAGuF,CAAC,CAAC;AAAA,YAE7C;AAEF,mBAASvF,IAAI,GAAGA,IAAI6F,GAAG7F;AACrB,YAAAqQ,EAAE,IAAIrQ,GAAGuF,GAAG,CAAC;AAEf,UAAA8K,EAAE,IAAI9K,GAAGA,GAAG,CAAC;AAAA,QACf;AAGF,UAAIoL,IAAK7K,IAAI,GACT8K,IAAM,OAAO;AACjB,aAAO9K,IAAI,KAAG;AACZ,YAAIP,GAAGsL;AACP,aAAKtL,IAAIO,IAAI,GAAGP,KAAK,MACfA,MAAM,IADaA,KAAK;AAI5B,gBAAMuL,IACJ,OAAO,YAAYF,IAAM,KAAK,IAAI9J,EAAEvB,CAAC,IAAI,KAAK,IAAIuB,EAAEvB,IAAI,CAAC,CAAC,CAAC;AAC7D,cAAI,KAAK,IAAI0B,EAAE1B,CAAC,CAAC,KAAKuL,KAAS,OAAO,MAAM7J,EAAE1B,CAAC,CAAC,GAAG;AACjD,YAAA0B,EAAE1B,CAAC,IAAI;AACP;AAAA,UACF;AAAA,QACF;AACA,YAAIA,MAAMO,IAAI;AACZ,UAAA+K,IAAO;AAAA,aACF;AACL,cAAIE;AACJ,eAAKA,IAAKjL,IAAI,GAAGiL,KAAMxL,KACjBwL,MAAOxL,GADawL,KAAM;AAI9B,gBAAIhC,KACDgC,MAAOjL,IAAI,KAAK,IAAImB,EAAE8J,CAAE,CAAC,IAAI,MAC7BA,MAAOxL,IAAI,IAAI,KAAK,IAAI0B,EAAE8J,IAAK,CAAC,CAAC,IAAI;AACxC,gBAAI,KAAK,IAAIjK,EAAEiK,CAAE,CAAC,KAAKH,IAAM7B,GAAG;AAC9B,cAAAjI,EAAEiK,CAAE,IAAI;AACR;AAAA,YACF;AAAA,UACF;AACA,UAAIA,MAAOxL,IACTsL,IAAO,IACEE,MAAOjL,IAAI,IACpB+K,IAAO,KAEPA,IAAO,GACPtL,IAAIwL;AAAA,QAER;AAIA,gBAFAxL,KAEQsL,GAAI;AAAA,UACV,KAAK,GAAG;AACN,gBAAIG,IAAI/J,EAAEnB,IAAI,CAAC;AACf,YAAAmB,EAAEnB,IAAI,CAAC,IAAI;AACX,qBAAS7F,IAAI6F,IAAI,GAAG7F,KAAKsF,GAAGtF,KAAK;AAC/B,kBAAI8O,IAAIM,GAAWvI,EAAE7G,CAAC,GAAG+Q,CAAC,GACtBC,IAAKnK,EAAE7G,CAAC,IAAI8O,GACZmC,IAAKF,IAAIjC;AAMb,kBALAjI,EAAE7G,CAAC,IAAI8O,GACH9O,MAAMsF,MACRyL,IAAI,CAACE,IAAKjK,EAAEhH,IAAI,CAAC,GACjBgH,EAAEhH,IAAI,CAAC,IAAIgR,IAAKhK,EAAEhH,IAAI,CAAC,IAErB8P;AACF,yBAAS/P,IAAI,GAAGA,IAAI6F,GAAG7F;AACrB,kBAAA+O,IAAIkC,IAAKZ,EAAE,IAAIrQ,GAAGC,CAAC,IAAIiR,IAAKb,EAAE,IAAIrQ,GAAG8F,IAAI,CAAC,GAC1CuK,EAAE,IAAIrQ,GAAG8F,IAAI,GAAG,CAACoL,IAAKb,EAAE,IAAIrQ,GAAGC,CAAC,IAAIgR,IAAKZ,EAAE,IAAIrQ,GAAG8F,IAAI,CAAC,CAAC,GACxDuK,EAAE,IAAIrQ,GAAGC,GAAG8O,CAAC;AAAA,YAGnB;AACA;AAAA,UACF;AAAA,UACA,KAAK,GAAG;AACN,gBAAIiC,IAAI/J,EAAE1B,IAAI,CAAC;AACf,YAAA0B,EAAE1B,IAAI,CAAC,IAAI;AACX,qBAAStF,IAAIsF,GAAGtF,IAAI6F,GAAG7F,KAAK;AAC1B,kBAAI8O,IAAIM,GAAWvI,EAAE7G,CAAC,GAAG+Q,CAAC,GACtBC,IAAKnK,EAAE7G,CAAC,IAAI8O,GACZmC,IAAKF,IAAIjC;AAIb,kBAHAjI,EAAE7G,CAAC,IAAI8O,GACPiC,IAAI,CAACE,IAAKjK,EAAEhH,CAAC,GACbgH,EAAEhH,CAAC,IAAIgR,IAAKhK,EAAEhH,CAAC,GACX6P;AACF,yBAAS9P,IAAI,GAAGA,IAAI4F,GAAG5F;AACrB,kBAAA+O,IAAIkC,IAAKb,EAAE,IAAIpQ,GAAGC,CAAC,IAAIiR,IAAKd,EAAE,IAAIpQ,GAAGuF,IAAI,CAAC,GAC1C6K,EAAE,IAAIpQ,GAAGuF,IAAI,GAAG,CAAC2L,IAAKd,EAAE,IAAIpQ,GAAGC,CAAC,IAAIgR,IAAKb,EAAE,IAAIpQ,GAAGuF,IAAI,CAAC,CAAC,GACxD6K,EAAE,IAAIpQ,GAAGC,GAAG8O,CAAC;AAAA,YAGnB;AACA;AAAA,UACF;AAAA,UACA,KAAK,GAAG;AACN,kBAAMlL,IAAQ,KAAK;AAAA,cACjB,KAAK,IAAIiD,EAAEhB,IAAI,CAAC,CAAC;AAAA,cACjB,KAAK,IAAIgB,EAAEhB,IAAI,CAAC,CAAC;AAAA,cACjB,KAAK,IAAImB,EAAEnB,IAAI,CAAC,CAAC;AAAA,cACjB,KAAK,IAAIgB,EAAEvB,CAAC,CAAC;AAAA,cACb,KAAK,IAAI0B,EAAE1B,CAAC,CAAC;AAAA,YAC1B,GACiB4L,IAAKrK,EAAEhB,IAAI,CAAC,IAAIjC,GAChBuN,IAAOtK,EAAEhB,IAAI,CAAC,IAAIjC,GAClBwN,IAAOpK,EAAEnB,IAAI,CAAC,IAAIjC,GAClByN,IAAKxK,EAAEvB,CAAC,IAAI1B,GACZ0N,IAAKtK,EAAE1B,CAAC,IAAI1B,GACZmH,MAAMoG,IAAOD,MAAOC,IAAOD,KAAME,IAAOA,KAAQ,GAChDzG,IAAIuG,IAAKE,KAAQF,IAAKE;AAC5B,gBAAIG,IAAQ;AACZ,aAAIxG,MAAM,KAAKJ,MAAM,OACfI,IAAI,IACNwG,IAAQ,IAAI,KAAK,KAAKxG,IAAIA,IAAIJ,CAAC,IAE/B4G,IAAQ,KAAK,KAAKxG,IAAIA,IAAIJ,CAAC,GAE7B4G,IAAQ5G,KAAKI,IAAIwG;AAEnB,gBAAIR,KAAKM,IAAKH,MAAOG,IAAKH,KAAMK,GAC5BC,KAAIH,IAAKC;AACb,qBAAStR,IAAIsF,GAAGtF,IAAI6F,IAAI,GAAG7F,KAAK;AAC9B,kBAAI8O,IAAIM,GAAW2B,GAAGS,EAAC;AACvB,cAAI1C,MAAM,MAAGA,IAAI,OAAO;AACxB,kBAAIkC,IAAKD,IAAIjC,GACTmC,IAAKO,KAAI1C;AAQb,kBAPI9O,MAAMsF,MACR0B,EAAEhH,IAAI,CAAC,IAAI8O,IAEbiC,IAAIC,IAAKnK,EAAE7G,CAAC,IAAIiR,IAAKjK,EAAEhH,CAAC,GACxBgH,EAAEhH,CAAC,IAAIgR,IAAKhK,EAAEhH,CAAC,IAAIiR,IAAKpK,EAAE7G,CAAC,GAC3BwR,KAAIP,IAAKpK,EAAE7G,IAAI,CAAC,GAChB6G,EAAE7G,IAAI,CAAC,IAAIgR,IAAKnK,EAAE7G,IAAI,CAAC,GACnB8P;AACF,yBAAS/P,IAAI,GAAGA,IAAI6F,GAAG7F;AACrB,kBAAA+O,IAAIkC,IAAKZ,EAAE,IAAIrQ,GAAGC,CAAC,IAAIiR,IAAKb,EAAE,IAAIrQ,GAAGC,IAAI,CAAC,GAC1CoQ,EAAE,IAAIrQ,GAAGC,IAAI,GAAG,CAACiR,IAAKb,EAAE,IAAIrQ,GAAGC,CAAC,IAAIgR,IAAKZ,EAAE,IAAIrQ,GAAGC,IAAI,CAAC,CAAC,GACxDoQ,EAAE,IAAIrQ,GAAGC,GAAG8O,CAAC;AAYjB,kBATAA,IAAIM,GAAW2B,GAAGS,EAAC,GACf1C,MAAM,MAAGA,IAAI,OAAO,YACxBkC,IAAKD,IAAIjC,GACTmC,IAAKO,KAAI1C,GACTjI,EAAE7G,CAAC,IAAI8O,GACPiC,IAAIC,IAAKhK,EAAEhH,CAAC,IAAIiR,IAAKpK,EAAE7G,IAAI,CAAC,GAC5B6G,EAAE7G,IAAI,CAAC,IAAI,CAACiR,IAAKjK,EAAEhH,CAAC,IAAIgR,IAAKnK,EAAE7G,IAAI,CAAC,GACpCwR,KAAIP,IAAKjK,EAAEhH,IAAI,CAAC,GAChBgH,EAAEhH,IAAI,CAAC,IAAIgR,IAAKhK,EAAEhH,IAAI,CAAC,GACnB6P,KAAS7P,IAAI2F,IAAI;AACnB,yBAAS5F,IAAI,GAAGA,IAAI4F,GAAG5F;AACrB,kBAAA+O,IAAIkC,IAAKb,EAAE,IAAIpQ,GAAGC,CAAC,IAAIiR,IAAKd,EAAE,IAAIpQ,GAAGC,IAAI,CAAC,GAC1CmQ,EAAE,IAAIpQ,GAAGC,IAAI,GAAG,CAACiR,IAAKd,EAAE,IAAIpQ,GAAGC,CAAC,IAAIgR,IAAKb,EAAE,IAAIpQ,GAAGC,IAAI,CAAC,CAAC,GACxDmQ,EAAE,IAAIpQ,GAAGC,GAAG8O,CAAC;AAAA,YAGnB;AACA,YAAA9H,EAAEnB,IAAI,CAAC,IAAIkL;AACX;AAAA,UACF;AAAA,UACA,KAAK,GAAG;AACN,gBAAIlK,EAAEvB,CAAC,KAAK,MACVuB,EAAEvB,CAAC,IAAIuB,EAAEvB,CAAC,IAAI,IAAI,CAACuB,EAAEvB,CAAC,IAAI,GACtBwK;AACF,uBAAS/P,IAAI,GAAGA,KAAK2Q,GAAI3Q;AACvB,gBAAAqQ,EAAE,IAAIrQ,GAAGuF,GAAG,CAAC8K,EAAE,IAAIrQ,GAAGuF,CAAC,CAAC;AAI9B,mBAAOA,IAAIoL,KACL,EAAA7J,EAAEvB,CAAC,KAAKuB,EAAEvB,IAAI,CAAC,MADN;AAIb,kBAAIwJ,IAAIjI,EAAEvB,CAAC;AAGX,kBAFAuB,EAAEvB,CAAC,IAAIuB,EAAEvB,IAAI,CAAC,GACduB,EAAEvB,IAAI,CAAC,IAAIwJ,GACPgB,KAASxK,IAAIM,IAAI;AACnB,yBAAS7F,IAAI,GAAGA,IAAI6F,GAAG7F;AACrB,kBAAA+O,IAAIsB,EAAE,IAAIrQ,GAAGuF,IAAI,CAAC,GAClB8K,EAAE,IAAIrQ,GAAGuF,IAAI,GAAG8K,EAAE,IAAIrQ,GAAGuF,CAAC,CAAC,GAC3B8K,EAAE,IAAIrQ,GAAGuF,GAAGwJ,CAAC;AAGjB,kBAAIe,KAASvK,IAAIK,IAAI;AACnB,yBAAS5F,IAAI,GAAGA,IAAI4F,GAAG5F;AACrB,kBAAA+O,IAAIqB,EAAE,IAAIpQ,GAAGuF,IAAI,CAAC,GAClB6K,EAAE,IAAIpQ,GAAGuF,IAAI,GAAG6K,EAAE,IAAIpQ,GAAGuF,CAAC,CAAC,GAC3B6K,EAAE,IAAIpQ,GAAGuF,GAAGwJ,CAAC;AAGjB,cAAAxJ;AAAA,YACF;AACA,YAAAO;AACA;AAAA,UACF;AAAA,QAET;AAAA,MACK;AAEA,UAAIkK,GAAS;AACX,YAAItK,IAAM2K;AACV,QAAAA,IAAID,GACJA,IAAI1K;AAAA,MACN;AAEA,WAAK,IAAIE,GACT,KAAK,IAAIC,GACT,KAAK,IAAIiB,GACT,KAAK,IAAIsJ,GACT,KAAK,IAAIC;AAAA,IACX;AAAA,IAEA,MAAMxP,GAAO;AACX,UAAI6Q,IAAI7Q,GACJoG,IAAI,KAAK,WACT0K,IAAQ,KAAK,EAAE,QACfC,IAAKhR,EAAO,MAAM+Q,GAAOA,CAAK;AAElC,eAAS3R,IAAI,GAAGA,IAAI2R,GAAO3R;AACzB,QAAI,KAAK,IAAI,KAAK,EAAEA,CAAC,CAAC,KAAKiH,IACzB2K,EAAG,IAAI5R,GAAGA,GAAG,CAAC,IAEd4R,EAAG,IAAI5R,GAAGA,GAAG,IAAI,KAAK,EAAEA,CAAC,CAAC;AAI9B,UAAIoQ,IAAI,KAAK,GACTC,IAAI,KAAK,sBAETwB,IAAKxB,EAAE,KAAKuB,CAAE,GACdE,IAAQzB,EAAE,MACV0B,IAAQ3B,EAAE,MACV4B,IAAMpR,EAAO,MAAMkR,GAAOC,CAAK;AAEnC,eAAS/R,IAAI,GAAGA,IAAI8R,GAAO9R;AACzB,iBAAS,IAAI,GAAG,IAAI+R,GAAO,KAAK;AAC9B,cAAIxP,IAAM;AACV,mBAASgD,IAAI,GAAGA,IAAIoM,GAAOpM;AACzB,YAAAhD,KAAOsP,EAAG,IAAI7R,GAAGuF,CAAC,IAAI6K,EAAE,IAAI,GAAG7K,CAAC;AAElC,UAAAyM,EAAI,IAAIhS,GAAG,GAAGuC,CAAG;AAAA,QACnB;AAGF,aAAOyP,EAAI,KAAKN,CAAC;AAAA,IACnB;AAAA,IAEA,iBAAiB7Q,GAAO;AACtB,aAAO,KAAK,MAAMD,EAAO,KAAKC,CAAK,CAAC;AAAA,IACtC;AAAA,IAEA,UAAU;AACR,UAAIwP,IAAI,KAAK,GACT,IAAI,KAAK,WACTyB,IAAQzB,EAAE,MACV4B,IAAQ5B,EAAE,SACVlB,IAAI,IAAIvO,EAAOkR,GAAO,KAAK,EAAE,MAAM;AAEvC,eAAS9R,IAAI,GAAGA,IAAI8R,GAAO9R;AACzB,iBAASC,IAAI,GAAGA,IAAIgS,GAAOhS;AACzB,UAAI,KAAK,IAAI,KAAK,EAAEA,CAAC,CAAC,IAAI,KACxBkP,EAAE,IAAInP,GAAGC,GAAGoQ,EAAE,IAAIrQ,GAAGC,CAAC,IAAI,KAAK,EAAEA,CAAC,CAAC;AAKzC,UAAImQ,IAAI,KAAK,GAET2B,IAAQ3B,EAAE,MACV8B,IAAQ9B,EAAE,SACVsB,IAAI,IAAI9Q,EAAOkR,GAAOC,CAAK;AAE/B,eAAS/R,IAAI,GAAGA,IAAI8R,GAAO9R;AACzB,iBAASC,IAAI,GAAGA,IAAI8R,GAAO9R,KAAK;AAC9B,cAAIsC,IAAM;AACV,mBAASgD,IAAI,GAAGA,IAAI2M,GAAO3M;AACzB,YAAAhD,KAAO4M,EAAE,IAAInP,GAAGuF,CAAC,IAAI6K,EAAE,IAAInQ,GAAGsF,CAAC;AAEjC,UAAAmM,EAAE,IAAI1R,GAAGC,GAAGsC,CAAG;AAAA,QACjB;AAGF,aAAOmP;AAAA,IACT;AAAA,IAEA,IAAI,YAAY;AACd,aAAO,KAAK,EAAE,CAAC,IAAI,KAAK,EAAE,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;AAAA,IACxD;AAAA,IAEA,IAAI,QAAQ;AACV,aAAO,KAAK,EAAE,CAAC;AAAA,IACjB;AAAA,IAEA,IAAI,OAAO;AACT,UAAIS,IAAM,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,OAAO,SACpDxH,IAAI,GACJ7D,IAAI,KAAK;AACb,eAAS9G,IAAI,GAAGoS,IAAKtL,EAAE,QAAQ9G,IAAIoS,GAAIpS;AACrC,QAAI8G,EAAE9G,CAAC,IAAImS,KACTxH;AAGJ,aAAOA;AAAA,IACT;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,MAAM,KAAK,KAAK,CAAC;AAAA,IAC1B;AAAA,IAEA,IAAI,YAAY;AACd,aAAQ,OAAO,UAAU,IAAK,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;AAAA,IACnE;AAAA,IAEA,IAAI,sBAAsB;AACxB,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,IAAI,uBAAuB;AACzB,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,IAAI,iBAAiB;AACnB,aAAO/J,EAAO,KAAK,KAAK,CAAC;AAAA,IAC3B;AAAA,EACH;AAEC,WAASyR,GAAQ1T,GAAQ2T,IAAS,IAAO;AAEvC,WADA3T,IAAS8P,EAAgB,YAAY9P,CAAM,GACvC2T,IACK,IAAI5C,GAA2B/Q,CAAM,EAAE,QAAO,IAE9C4T,GAAM5T,GAAQiC,EAAO,IAAIjC,EAAO,IAAI,CAAC;AAAA,EAEhD;AAEA,WAAS4T,GAAMC,GAAcC,GAAeH,IAAS,IAAO;AAG1D,WAFAE,IAAe/D,EAAgB,YAAY+D,CAAY,GACvDC,IAAgBhE,EAAgB,YAAYgE,CAAa,GACrDH,IACK,IAAI5C,GAA2B8C,CAAY,EAAE,MAAMC,CAAa,IAEhED,EAAa,SAAQ,IACxB,IAAI7D,GAAgB6D,CAAY,EAAE,MAAMC,CAAa,IACrD,IAAInD,GAAgBkD,CAAY,EAAE,MAAMC,CAAa;AAAA,EAE7D;AAEA,WAASrD,GAAYzQ,GAAQ;AAE3B,QADAA,IAASiC,EAAO,YAAYjC,CAAM,GAC9BA,EAAO,YAAY;AACrB,UAAIA,EAAO,YAAY;AACrB,eAAO;AAGT,UAAIoM,GAAGC,GAAGJ,GAAG8H;AACb,UAAI/T,EAAO,YAAY;AAErB,eAAAoM,IAAIpM,EAAO,IAAI,GAAG,CAAC,GACnBqM,IAAIrM,EAAO,IAAI,GAAG,CAAC,GACnBiM,IAAIjM,EAAO,IAAI,GAAG,CAAC,GACnB+T,IAAI/T,EAAO,IAAI,GAAG,CAAC,GAEZoM,IAAI2H,IAAI1H,IAAIJ;AACd,UAAIjM,EAAO,YAAY,GAAG;AAE/B,YAAIgU,GAAYC,GAAYC;AAC5B,eAAAF,IAAa,IAAItE,GAAoB1P,GAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAC3DiU,IAAa,IAAIvE,GAAoB1P,GAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAC3DkU,IAAa,IAAIxE,GAAoB1P,GAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAC3DoM,IAAIpM,EAAO,IAAI,GAAG,CAAC,GACnBqM,IAAIrM,EAAO,IAAI,GAAG,CAAC,GACnBiM,IAAIjM,EAAO,IAAI,GAAG,CAAC,GAGjBoM,IAAIqE,GAAYuD,CAAU,IAC1B3H,IAAIoE,GAAYwD,CAAU,IAC1BhI,IAAIwE,GAAYyD,CAAU;AAAA,MAE9B;AAEE,eAAO,IAAIlE,GAAgBhQ,CAAM,EAAE;AAAA,IAEvC;AACE,YAAM,MAAM,wDAAwD;AAAA,EAExE;AAEA,WAASmU,GAAOjN,GAAGkN,GAAW;AAC5B,QAAIC,IAAQ,CAAA;AACZ,aAAShT,IAAI,GAAGA,IAAI6F,GAAG7F;AACrB,MAAIA,MAAM+S,KACRC,EAAM,KAAKhT,CAAC;AAGhB,WAAOgT;AAAA,EACT;AAEA,WAASC,GACPC,GACAvU,GACAqC,GACAmS,IAAiB,MACjBC,IAAiB,MACjB;AACA,QAAIF,IAAQE;AACV,aAAO,IAAI,MAAMzU,EAAO,OAAO,CAAC,EAAE,KAAK,CAAC;AACnC;AACL,UAAI0U,IAAc1U,EAAO,OAAOqC,GAAO,CAAC,CAAC,CAAC;AAC1C,eAAShB,IAAI,GAAGA,IAAIqT,EAAY,MAAMrT;AACpC,QAAI,KAAK,IAAIqT,EAAY,IAAIrT,GAAG,CAAC,CAAC,IAAImT,KACpCE,EAAY,IAAIrT,GAAG,GAAG,CAAC;AAG3B,aAAOqT,EAAY,UAAS;AAAA,IAC9B;AAAA,EACF;AAEA,WAASC,GAAmB3U,GAAQS,IAAU,IAAI;AAChD,UAAM,EAAE,gBAAA+T,IAAiB,MAAQ,gBAAAC,IAAiB,KAAM,IAAKhU;AAC7D,IAAAT,IAASiC,EAAO,YAAYjC,CAAM;AAElC,QAAIkH,IAAIlH,EAAO,MACX4U,IAAU,IAAI3S,EAAOiF,GAAGA,CAAC;AAE7B,aAAS7F,IAAI,GAAGA,IAAI6F,GAAG7F,KAAK;AAC1B,UAAIgL,IAAIpK,EAAO,aAAajC,EAAO,OAAOqB,CAAC,CAAC,GACxCwT,IAAO7U,EAAO,aAAamU,GAAOjN,GAAG7F,CAAC,CAAC,EAAE,UAAS,GAElDqD,IADM,IAAIqM,GAA2B8D,CAAI,EACjC,MAAMxI,CAAC,GACfkI,IAAQtS,EAAO,IAAIoK,GAAGwI,EAAK,KAAKnQ,CAAC,CAAC,EAAE,IAAG,EAAG,IAAG;AACjD,MAAAkQ,EAAQ;AAAA,QACNvT;AAAA,QACAiT,GAAmBC,GAAO7P,GAAGrD,GAAGmT,GAAgBC,CAAc;AAAA,MACrE;AAAA,IACG;AACA,WAAOG;AAAA,EACT;AAEA,WAASE,GAAc9U,GAAQ+U,IAAY,OAAO,SAAS;AAEzD,QADA/U,IAASiC,EAAO,YAAYjC,CAAM,GAC9BA,EAAO;AAIT,aAAOA,EAAO,UAAS;AAEzB,QAAIgV,IAAc,IAAIjE,GAA2B/Q,GAAQ,EAAE,eAAe,IAAM,GAE5EyR,IAAIuD,EAAY,qBAChBtD,IAAIsD,EAAY,sBAChB7M,IAAI6M,EAAY;AAEpB,aAAS3T,IAAI,GAAGA,IAAI8G,EAAE,QAAQ9G;AAC5B,MAAI,KAAK,IAAI8G,EAAE9G,CAAC,CAAC,IAAI0T,IACnB5M,EAAE9G,CAAC,IAAI,IAAM8G,EAAE9G,CAAC,IAEhB8G,EAAE9G,CAAC,IAAI;AAIX,WAAOqQ,EAAE,KAAKzP,EAAO,KAAKkG,CAAC,EAAE,KAAKsJ,EAAE,UAAS,CAAE,CAAC;AAAA,EAClD;AAEA,WAASwD,GAAWC,GAASC,IAAUD,GAASzU,IAAU,CAAA,GAAI;AAC5D,IAAAyU,IAAU,IAAIjT,EAAOiT,CAAO;AAC5B,QAAIE,IAAU;AAYd,QAVE,OAAOD,KAAY,YACnB,CAAClT,EAAO,SAASkT,CAAO,KACxB,CAAClV,EAAW,WAAWkV,CAAO,KAE9B1U,IAAU0U,GACVA,IAAUD,GACVE,IAAU,MAEVD,IAAU,IAAIlT,EAAOkT,CAAO,GAE1BD,EAAQ,SAASC,EAAQ;AAC3B,YAAM,IAAI,UAAU,iDAAiD;AAEvE,UAAM,EAAE,QAAA7H,IAAS,GAAI,IAAK7M;AAC1B,IAAI6M,MACF4H,IAAUA,EAAQ,OAAO,QAAQ,GAC5BE,MACHD,IAAUA,EAAQ,OAAO,QAAQ;AAGrC,UAAME,IAAMH,EAAQ,UAAS,EAAG,KAAKC,CAAO;AAC5C,aAAS9T,IAAI,GAAGA,IAAIgU,EAAI,MAAMhU;AAC5B,eAASC,IAAI,GAAGA,IAAI+T,EAAI,SAAS/T;AAC/B,QAAA+T,EAAI,IAAIhU,GAAGC,GAAG+T,EAAI,IAAIhU,GAAGC,CAAC,KAAK,KAAK4T,EAAQ,OAAO,GAAG;AAG1D,WAAOG;AAAA,EACT;AAEA,WAASC,GAAYJ,GAASC,IAAUD,GAASzU,IAAU,CAAA,GAAI;AAC7D,IAAAyU,IAAU,IAAIjT,EAAOiT,CAAO;AAC5B,QAAIE,IAAU;AAYd,QAVE,OAAOD,KAAY,YACnB,CAAClT,EAAO,SAASkT,CAAO,KACxB,CAAClV,EAAW,WAAWkV,CAAO,KAE9B1U,IAAU0U,GACVA,IAAUD,GACVE,IAAU,MAEVD,IAAU,IAAIlT,EAAOkT,CAAO,GAE1BD,EAAQ,SAASC,EAAQ;AAC3B,YAAM,IAAI,UAAU,iDAAiD;AAGvE,UAAM,EAAE,QAAA7H,IAAS,IAAM,OAAApI,IAAQ,GAAI,IAAKzE;AACxC,IAAI6M,MACF4H,EAAQ,OAAO,QAAQ,GAClBE,KACHD,EAAQ,OAAO,QAAQ,IAGvBjQ,MACFgQ,EAAQ,MAAM,QAAQ,GACjBE,KACHD,EAAQ,MAAM,QAAQ;AAI1B,UAAMI,IAAML,EAAQ,kBAAkB,UAAU,EAAE,UAAU,IAAM,GAC5DM,IAAMJ,IACRG,IACAJ,EAAQ,kBAAkB,UAAU,EAAE,UAAU,GAAI,CAAE,GAEpDM,IAAOP,EAAQ,UAAS,EAAG,KAAKC,CAAO;AAC7C,aAAS9T,IAAI,GAAGA,IAAIoU,EAAK,MAAMpU;AAC7B,eAASC,IAAI,GAAGA,IAAImU,EAAK,SAASnU;AAChC,QAAAmU,EAAK;AAAA,UACHpU;AAAA,UACAC;AAAA,UACAmU,EAAK,IAAIpU,GAAGC,CAAC,KAAK,KAAKiU,EAAIlU,CAAC,IAAImU,EAAIlU,CAAC,OAAO,KAAK4T,EAAQ,OAAO;AAAA,QACzE;AAGG,WAAOO;AAAA,EACT;AAAA,EAEA,MAAMC,GAAwB;AAAA,IAC5B,YAAY1V,GAAQS,IAAU,IAAI;AAChC,YAAM,EAAE,iBAAAkV,IAAkB,GAAK,IAAKlV;AAGpC,UADAT,IAAS8P,EAAgB,YAAY9P,CAAM,GACvC,CAACA,EAAO;AACV,cAAM,IAAI,MAAM,+BAA+B;AAGjD,UAAIA,EAAO;AACT,cAAM,IAAI,MAAM,0BAA0B;AAG5C,UAAIkH,IAAIlH,EAAO,SACX0R,IAAI,IAAIzP,EAAOiF,GAAGA,CAAC,GACnB6M,IAAI,IAAI,aAAa7M,CAAC,GACtBoB,IAAI,IAAI,aAAapB,CAAC,GACtBhF,IAAQlC,GACRqB,GAAGC,GAEHsU,IAAc;AAOlB,UANID,IACFC,IAAc,KAEdA,IAAc5V,EAAO,YAAW,GAG9B4V,GAAa;AACf,aAAKvU,IAAI,GAAGA,IAAI6F,GAAG7F;AACjB,eAAKC,IAAI,GAAGA,IAAI4F,GAAG5F;AACjB,YAAAoQ,EAAE,IAAIrQ,GAAGC,GAAGY,EAAM,IAAIb,GAAGC,CAAC,CAAC;AAG/B,QAAAuU,GAAM3O,GAAGoB,GAAGyL,GAAGrC,CAAC,GAChBoE,GAAK5O,GAAGoB,GAAGyL,GAAGrC,CAAC;AAAA,MACjB,OAAO;AACL,YAAIqE,IAAI,IAAI9T,EAAOiF,GAAGA,CAAC,GACnB8O,IAAM,IAAI,aAAa9O,CAAC;AAC5B,aAAK5F,IAAI,GAAGA,IAAI4F,GAAG5F;AACjB,eAAKD,IAAI,GAAGA,IAAI6F,GAAG7F;AACjB,YAAA0U,EAAE,IAAI1U,GAAGC,GAAGY,EAAM,IAAIb,GAAGC,CAAC,CAAC;AAG/B,QAAA2U,GAAO/O,GAAG6O,GAAGC,GAAKtE,CAAC,GACnBwE,GAAKhP,GAAGoB,GAAGyL,GAAGrC,GAAGqE,CAAC;AAAA,MACpB;AAEA,WAAK,IAAI7O,GACT,KAAK,IAAIoB,GACT,KAAK,IAAIyL,GACT,KAAK,IAAIrC;AAAA,IACX;AAAA,IAEA,IAAI,kBAAkB;AACpB,aAAO,MAAM,KAAK,KAAK,CAAC;AAAA,IAC1B;AAAA,IAEA,IAAI,uBAAuB;AACzB,aAAO,MAAM,KAAK,KAAK,CAAC;AAAA,IAC1B;AAAA,IAEA,IAAI,oBAAoB;AACtB,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,IAAI,iBAAiB;AACnB,UAAIxK,IAAI,KAAK,GACT,IAAI,KAAK,GACT6M,IAAI,KAAK,GACTvD,IAAI,IAAIvO,EAAOiF,GAAGA,CAAC,GACnB7F,GAAGC;AACP,WAAKD,IAAI,GAAGA,IAAI6F,GAAG7F,KAAK;AACtB,aAAKC,IAAI,GAAGA,IAAI4F,GAAG5F;AACjB,UAAAkP,EAAE,IAAInP,GAAGC,GAAG,CAAC;AAEf,QAAAkP,EAAE,IAAInP,GAAGA,GAAG0S,EAAE1S,CAAC,CAAC,GACZ,EAAEA,CAAC,IAAI,IACTmP,EAAE,IAAInP,GAAGA,IAAI,GAAG,EAAEA,CAAC,CAAC,IACX,EAAEA,CAAC,IAAI,KAChBmP,EAAE,IAAInP,GAAGA,IAAI,GAAG,EAAEA,CAAC,CAAC;AAAA,MAExB;AACA,aAAOmP;AAAA,IACT;AAAA,EACH;AAEC,WAASqF,GAAM3O,GAAGoB,GAAGyL,GAAGrC,GAAG;AACzB,QAAIW,GAAGS,GAAGjM,GAAGxF,GAAGC,GAAGsF,GAAGuP,GAAIjR;AAE1B,SAAK5D,IAAI,GAAGA,IAAI4F,GAAG5F;AACjB,MAAAyS,EAAEzS,CAAC,IAAIoQ,EAAE,IAAIxK,IAAI,GAAG5F,CAAC;AAGvB,SAAKD,IAAI6F,IAAI,GAAG7F,IAAI,GAAGA,KAAK;AAG1B,WAFA6D,IAAQ,GACR2B,IAAI,GACCD,IAAI,GAAGA,IAAIvF,GAAGuF;AACjB,QAAA1B,IAAQA,IAAQ,KAAK,IAAI6O,EAAEnN,CAAC,CAAC;AAG/B,UAAI1B,MAAU;AAEZ,aADAoD,EAAEjH,CAAC,IAAI0S,EAAE1S,IAAI,CAAC,GACTC,IAAI,GAAGA,IAAID,GAAGC;AACjB,UAAAyS,EAAEzS,CAAC,IAAIoQ,EAAE,IAAIrQ,IAAI,GAAGC,CAAC,GACrBoQ,EAAE,IAAIrQ,GAAGC,GAAG,CAAC,GACboQ,EAAE,IAAIpQ,GAAGD,GAAG,CAAC;AAAA,WAEV;AACL,aAAKuF,IAAI,GAAGA,IAAIvF,GAAGuF;AACjB,UAAAmN,EAAEnN,CAAC,KAAK1B,GACR2B,KAAKkN,EAAEnN,CAAC,IAAImN,EAAEnN,CAAC;AAYjB,aATAyL,IAAI0B,EAAE1S,IAAI,CAAC,GACXyR,IAAI,KAAK,KAAKjM,CAAC,GACXwL,IAAI,MACNS,IAAI,CAACA,IAGPxK,EAAEjH,CAAC,IAAI6D,IAAQ4N,GACfjM,IAAIA,IAAIwL,IAAIS,GACZiB,EAAE1S,IAAI,CAAC,IAAIgR,IAAIS,GACVxR,IAAI,GAAGA,IAAID,GAAGC;AACjB,UAAAgH,EAAEhH,CAAC,IAAI;AAGT,aAAKA,IAAI,GAAGA,IAAID,GAAGC,KAAK;AAItB,eAHA+Q,IAAI0B,EAAEzS,CAAC,GACPoQ,EAAE,IAAIpQ,GAAGD,GAAGgR,CAAC,GACbS,IAAIxK,EAAEhH,CAAC,IAAIoQ,EAAE,IAAIpQ,GAAGA,CAAC,IAAI+Q,GACpBzL,IAAItF,IAAI,GAAGsF,KAAKvF,IAAI,GAAGuF;AAC1B,YAAAkM,KAAKpB,EAAE,IAAI9K,GAAGtF,CAAC,IAAIyS,EAAEnN,CAAC,GACtB0B,EAAE1B,CAAC,KAAK8K,EAAE,IAAI9K,GAAGtF,CAAC,IAAI+Q;AAExB,UAAA/J,EAAEhH,CAAC,IAAIwR;AAAA,QACT;AAGA,aADAT,IAAI,GACC/Q,IAAI,GAAGA,IAAID,GAAGC;AACjB,UAAAgH,EAAEhH,CAAC,KAAKuF,GACRwL,KAAK/J,EAAEhH,CAAC,IAAIyS,EAAEzS,CAAC;AAIjB,aADA6U,IAAK9D,KAAKxL,IAAIA,IACTvF,IAAI,GAAGA,IAAID,GAAGC;AACjB,UAAAgH,EAAEhH,CAAC,KAAK6U,IAAKpC,EAAEzS,CAAC;AAGlB,aAAKA,IAAI,GAAGA,IAAID,GAAGC,KAAK;AAGtB,eAFA+Q,IAAI0B,EAAEzS,CAAC,GACPwR,IAAIxK,EAAEhH,CAAC,GACFsF,IAAItF,GAAGsF,KAAKvF,IAAI,GAAGuF;AACtB,YAAA8K,EAAE,IAAI9K,GAAGtF,GAAGoQ,EAAE,IAAI9K,GAAGtF,CAAC,KAAK+Q,IAAI/J,EAAE1B,CAAC,IAAIkM,IAAIiB,EAAEnN,CAAC,EAAE;AAEjD,UAAAmN,EAAEzS,CAAC,IAAIoQ,EAAE,IAAIrQ,IAAI,GAAGC,CAAC,GACrBoQ,EAAE,IAAIrQ,GAAGC,GAAG,CAAC;AAAA,QACf;AAAA,MACF;AACA,MAAAyS,EAAE1S,CAAC,IAAIwF;AAAA,IACT;AAEA,SAAKxF,IAAI,GAAGA,IAAI6F,IAAI,GAAG7F,KAAK;AAI1B,UAHAqQ,EAAE,IAAIxK,IAAI,GAAG7F,GAAGqQ,EAAE,IAAIrQ,GAAGA,CAAC,CAAC,GAC3BqQ,EAAE,IAAIrQ,GAAGA,GAAG,CAAC,GACbwF,IAAIkN,EAAE1S,IAAI,CAAC,GACPwF,MAAM,GAAG;AACX,aAAKD,IAAI,GAAGA,KAAKvF,GAAGuF;AAClB,UAAAmN,EAAEnN,CAAC,IAAI8K,EAAE,IAAI9K,GAAGvF,IAAI,CAAC,IAAIwF;AAG3B,aAAKvF,IAAI,GAAGA,KAAKD,GAAGC,KAAK;AAEvB,eADAwR,IAAI,GACClM,IAAI,GAAGA,KAAKvF,GAAGuF;AAClB,YAAAkM,KAAKpB,EAAE,IAAI9K,GAAGvF,IAAI,CAAC,IAAIqQ,EAAE,IAAI9K,GAAGtF,CAAC;AAEnC,eAAKsF,IAAI,GAAGA,KAAKvF,GAAGuF;AAClB,YAAA8K,EAAE,IAAI9K,GAAGtF,GAAGoQ,EAAE,IAAI9K,GAAGtF,CAAC,IAAIwR,IAAIiB,EAAEnN,CAAC,CAAC;AAAA,QAEtC;AAAA,MACF;AAEA,WAAKA,IAAI,GAAGA,KAAKvF,GAAGuF;AAClB,QAAA8K,EAAE,IAAI9K,GAAGvF,IAAI,GAAG,CAAC;AAAA,IAErB;AAEA,SAAKC,IAAI,GAAGA,IAAI4F,GAAG5F;AACjB,MAAAyS,EAAEzS,CAAC,IAAIoQ,EAAE,IAAIxK,IAAI,GAAG5F,CAAC,GACrBoQ,EAAE,IAAIxK,IAAI,GAAG5F,GAAG,CAAC;AAGnB,IAAAoQ,EAAE,IAAIxK,IAAI,GAAGA,IAAI,GAAG,CAAC,GACrBoB,EAAE,CAAC,IAAI;AAAA,EACT;AAEA,WAASwN,GAAK5O,GAAGoB,GAAGyL,GAAGrC,GAAG;AACxB,QAAIoB,GAAGjM,GAAGxF,GAAGC,GAAGsF,GAAGT,GAAGc,GAAGE,GAAG6E,GAAGoK,GAAKnK,GAAGJ,GAAIwK,GAAIC,GAAKnO,GAAGoO;AAEvD,SAAKlV,IAAI,GAAGA,IAAI6F,GAAG7F;AACjB,MAAAiH,EAAEjH,IAAI,CAAC,IAAIiH,EAAEjH,CAAC;AAGhB,IAAAiH,EAAEpB,IAAI,CAAC,IAAI;AAEX,QAAImL,IAAI,GACJmE,IAAO,GACPvE,IAAM,OAAO;AAEjB,SAAK9L,IAAI,GAAGA,IAAIe,GAAGf,KAAK;AAGtB,WAFAqQ,IAAO,KAAK,IAAIA,GAAM,KAAK,IAAIzC,EAAE5N,CAAC,CAAC,IAAI,KAAK,IAAImC,EAAEnC,CAAC,CAAC,CAAC,GACrDc,IAAId,GACGc,IAAIC,KACL,OAAK,IAAIoB,EAAErB,CAAC,CAAC,KAAKgL,IAAMuE;AAG5B,QAAAvP;AAGF,UAAIA,IAAId;AACN,WAAG;AAaD,eAXA2M,IAAIiB,EAAE5N,CAAC,GACPgB,KAAK4M,EAAE5N,IAAI,CAAC,IAAI2M,MAAM,IAAIxK,EAAEnC,CAAC,IAC7B6F,IAAI0E,GAAWvJ,GAAG,CAAC,GACfA,IAAI,MACN6E,IAAI,CAACA,IAGP+H,EAAE5N,CAAC,IAAImC,EAAEnC,CAAC,KAAKgB,IAAI6E,IACnB+H,EAAE5N,IAAI,CAAC,IAAImC,EAAEnC,CAAC,KAAKgB,IAAI6E,IACvBoK,IAAMrC,EAAE5N,IAAI,CAAC,GACbU,IAAIiM,IAAIiB,EAAE5N,CAAC,GACN9E,IAAI8E,IAAI,GAAG9E,IAAI6F,GAAG7F;AACrB,YAAA0S,EAAE1S,CAAC,KAAKwF;AAYV,eATAwL,IAAIA,IAAIxL,GAERM,IAAI4M,EAAE9M,CAAC,GACPgF,IAAI,GACJJ,IAAKI,GACLoK,IAAKpK,GACLqK,IAAMhO,EAAEnC,IAAI,CAAC,GACbgC,IAAI,GACJoO,IAAK,GACAlV,IAAI4F,IAAI,GAAG5F,KAAK8E,GAAG9E;AAatB,iBAZAgV,IAAKxK,GACLA,IAAKI,GACLsK,IAAKpO,GACL2K,IAAI7G,IAAI3D,EAAEjH,CAAC,GACXwF,IAAIoF,IAAI9E,GACR6E,IAAI0E,GAAWvJ,GAAGmB,EAAEjH,CAAC,CAAC,GACtBiH,EAAEjH,IAAI,CAAC,IAAI8G,IAAI6D,GACf7D,IAAIG,EAAEjH,CAAC,IAAI2K,GACXC,IAAI9E,IAAI6E,GACR7E,IAAI8E,IAAI8H,EAAE1S,CAAC,IAAI8G,IAAI2K,GACnBiB,EAAE1S,IAAI,CAAC,IAAIwF,IAAIsB,KAAK8D,IAAI6G,IAAI3K,IAAI4L,EAAE1S,CAAC,IAE9BuF,IAAI,GAAGA,IAAIM,GAAGN;AACjB,cAAAC,IAAI6K,EAAE,IAAI9K,GAAGvF,IAAI,CAAC,GAClBqQ,EAAE,IAAI9K,GAAGvF,IAAI,GAAG8G,IAAIuJ,EAAE,IAAI9K,GAAGvF,CAAC,IAAI4K,IAAIpF,CAAC,GACvC6K,EAAE,IAAI9K,GAAGvF,GAAG4K,IAAIyF,EAAE,IAAI9K,GAAGvF,CAAC,IAAI8G,IAAItB,CAAC;AAIvC,UAAAM,IAAK,CAACgB,IAAIoO,IAAKF,IAAKC,IAAMhO,EAAEnC,CAAC,IAAKiQ,GAClC9N,EAAEnC,CAAC,IAAIgC,IAAIhB,GACX4M,EAAE5N,CAAC,IAAI8F,IAAI9E;AAAA,QACb,SAAS,KAAK,IAAImB,EAAEnC,CAAC,CAAC,IAAI8L,IAAMuE;AAElC,MAAAzC,EAAE5N,CAAC,IAAI4N,EAAE5N,CAAC,IAAIkM,GACd/J,EAAEnC,CAAC,IAAI;AAAA,IACT;AAEA,SAAK9E,IAAI,GAAGA,IAAI6F,IAAI,GAAG7F,KAAK;AAG1B,WAFAuF,IAAIvF,GACJ8F,IAAI4M,EAAE1S,CAAC,GACFC,IAAID,IAAI,GAAGC,IAAI4F,GAAG5F;AACrB,QAAIyS,EAAEzS,CAAC,IAAI6F,MACTP,IAAItF,GACJ6F,IAAI4M,EAAEzS,CAAC;AAIX,UAAIsF,MAAMvF;AAGR,aAFA0S,EAAEnN,CAAC,IAAImN,EAAE1S,CAAC,GACV0S,EAAE1S,CAAC,IAAI8F,GACF7F,IAAI,GAAGA,IAAI4F,GAAG5F;AACjB,UAAA6F,IAAIuK,EAAE,IAAIpQ,GAAGD,CAAC,GACdqQ,EAAE,IAAIpQ,GAAGD,GAAGqQ,EAAE,IAAIpQ,GAAGsF,CAAC,CAAC,GACvB8K,EAAE,IAAIpQ,GAAGsF,GAAGO,CAAC;AAAA,IAGnB;AAAA,EACF;AAEA,WAAS8O,GAAO/O,GAAG6O,GAAGC,GAAKtE,GAAG;AAC5B,QAAI+E,IAAM,GACNC,IAAOxP,IAAI,GACXmL,GAAGS,GAAG,GAAGzR,GAAGC,GAAG2F,GACf/B;AAEJ,SAAK+B,IAAIwP,IAAM,GAAGxP,KAAKyP,IAAO,GAAGzP,KAAK;AAEpC,WADA/B,IAAQ,GACH7D,IAAI4F,GAAG5F,KAAKqV,GAAMrV;AACrB,QAAA6D,IAAQA,IAAQ,KAAK,IAAI6Q,EAAE,IAAI1U,GAAG4F,IAAI,CAAC,CAAC;AAG1C,UAAI/B,MAAU,GAAG;AAEf,aADA,IAAI,GACC7D,IAAIqV,GAAMrV,KAAK4F,GAAG5F;AACrB,UAAA2U,EAAI3U,CAAC,IAAI0U,EAAE,IAAI1U,GAAG4F,IAAI,CAAC,IAAI/B,GAC3B,KAAK8Q,EAAI3U,CAAC,IAAI2U,EAAI3U,CAAC;AAWrB,aARAyR,IAAI,KAAK,KAAK,CAAC,GACXkD,EAAI/O,CAAC,IAAI,MACX6L,IAAI,CAACA,IAGP,IAAI,IAAIkD,EAAI/O,CAAC,IAAI6L,GACjBkD,EAAI/O,CAAC,IAAI+O,EAAI/O,CAAC,IAAI6L,GAEbxR,IAAI2F,GAAG3F,IAAI4F,GAAG5F,KAAK;AAEtB,eADA+Q,IAAI,GACChR,IAAIqV,GAAMrV,KAAK4F,GAAG5F;AACrB,YAAAgR,KAAK2D,EAAI3U,CAAC,IAAI0U,EAAE,IAAI1U,GAAGC,CAAC;AAI1B,eADA+Q,IAAIA,IAAI,GACHhR,IAAI4F,GAAG5F,KAAKqV,GAAMrV;AACrB,YAAA0U,EAAE,IAAI1U,GAAGC,GAAGyU,EAAE,IAAI1U,GAAGC,CAAC,IAAI+Q,IAAI2D,EAAI3U,CAAC,CAAC;AAAA,QAExC;AAEA,aAAKA,IAAI,GAAGA,KAAKqV,GAAMrV,KAAK;AAE1B,eADAgR,IAAI,GACC/Q,IAAIoV,GAAMpV,KAAK2F,GAAG3F;AACrB,YAAA+Q,KAAK2D,EAAI1U,CAAC,IAAIyU,EAAE,IAAI1U,GAAGC,CAAC;AAI1B,eADA+Q,IAAIA,IAAI,GACH/Q,IAAI2F,GAAG3F,KAAKoV,GAAMpV;AACrB,YAAAyU,EAAE,IAAI1U,GAAGC,GAAGyU,EAAE,IAAI1U,GAAGC,CAAC,IAAI+Q,IAAI2D,EAAI1U,CAAC,CAAC;AAAA,QAExC;AAEA,QAAA0U,EAAI/O,CAAC,IAAI/B,IAAQ8Q,EAAI/O,CAAC,GACtB8O,EAAE,IAAI9O,GAAGA,IAAI,GAAG/B,IAAQ4N,CAAC;AAAA,MAC3B;AAAA,IACF;AAEA,SAAKzR,IAAI,GAAGA,IAAI6F,GAAG7F;AACjB,WAAKC,IAAI,GAAGA,IAAI4F,GAAG5F;AACjB,QAAAoQ,EAAE,IAAIrQ,GAAGC,GAAGD,MAAMC,IAAI,IAAI,CAAC;AAI/B,SAAK2F,IAAIyP,IAAO,GAAGzP,KAAKwP,IAAM,GAAGxP;AAC/B,UAAI8O,EAAE,IAAI9O,GAAGA,IAAI,CAAC,MAAM,GAAG;AACzB,aAAK5F,IAAI4F,IAAI,GAAG5F,KAAKqV,GAAMrV;AACzB,UAAA2U,EAAI3U,CAAC,IAAI0U,EAAE,IAAI1U,GAAG4F,IAAI,CAAC;AAGzB,aAAK3F,IAAI2F,GAAG3F,KAAKoV,GAAMpV,KAAK;AAE1B,eADAwR,IAAI,GACCzR,IAAI4F,GAAG5F,KAAKqV,GAAMrV;AACrB,YAAAyR,KAAKkD,EAAI3U,CAAC,IAAIqQ,EAAE,IAAIrQ,GAAGC,CAAC;AAI1B,eADAwR,IAAIA,IAAIkD,EAAI/O,CAAC,IAAI8O,EAAE,IAAI9O,GAAGA,IAAI,CAAC,GAC1B5F,IAAI4F,GAAG5F,KAAKqV,GAAMrV;AACrB,YAAAqQ,EAAE,IAAIrQ,GAAGC,GAAGoQ,EAAE,IAAIrQ,GAAGC,CAAC,IAAIwR,IAAIkD,EAAI3U,CAAC,CAAC;AAAA,QAExC;AAAA,MACF;AAAA,EAEJ;AAEA,WAAS6U,GAAKS,GAAIrO,GAAGyL,GAAGrC,GAAGqE,GAAG;AAC5B,QAAI7O,IAAIyP,IAAK,GACTF,IAAM,GACNC,IAAOC,IAAK,GACZ1E,IAAM,OAAO,SACb2E,IAAU,GACVC,IAAO,GACP1P,IAAI,GACJwF,IAAI,GACJX,IAAI,GACJ7D,IAAI,GACJ2O,IAAI,GACJC,IAAO,GACP1V,GAAGC,GAAG,GAAG6E,GAAGc,GAAGmJ,GAAG4G,GAAGtS,GAAG+G,GACxBwL,GAAIC,GAAIC,GAAIC,GACZC,GAASC;AAEb,SAAKjW,IAAI,GAAGA,IAAIsV,GAAItV;AAMlB,YALIA,IAAIoV,KAAOpV,IAAIqV,OACjB3C,EAAE1S,CAAC,IAAI0U,EAAE,IAAI1U,GAAGA,CAAC,GACjBiH,EAAEjH,CAAC,IAAI,IAGJC,IAAI,KAAK,IAAID,IAAI,GAAG,CAAC,GAAGC,IAAIqV,GAAIrV;AACnC,QAAAuV,IAAOA,IAAO,KAAK,IAAId,EAAE,IAAI1U,GAAGC,CAAC,CAAC;AAItC,WAAO4F,KAAKuP,KAAK;AAEf,WADAtQ,IAAIe,GACGf,IAAIsQ,MACTtO,IAAI,KAAK,IAAI4N,EAAE,IAAI5P,IAAI,GAAGA,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI4P,EAAE,IAAI5P,GAAGA,CAAC,CAAC,GACpDgC,MAAM,MACRA,IAAI0O,IAEF,OAAK,IAAId,EAAE,IAAI5P,GAAGA,IAAI,CAAC,CAAC,IAAI8L,IAAM9J;AAGtC,QAAAhC;AAGF,UAAIA,MAAMe;AACR,QAAA6O,EAAE,IAAI7O,GAAGA,GAAG6O,EAAE,IAAI7O,GAAGA,CAAC,IAAI0P,CAAO,GACjC7C,EAAE7M,CAAC,IAAI6O,EAAE,IAAI7O,GAAGA,CAAC,GACjBoB,EAAEpB,CAAC,IAAI,GACPA,KACA6P,IAAO;AAAA,eACE5Q,MAAMe,IAAI,GAAG;AAStB,YARA8P,IAAIjB,EAAE,IAAI7O,GAAGA,IAAI,CAAC,IAAI6O,EAAE,IAAI7O,IAAI,GAAGA,CAAC,GACpCC,KAAK4O,EAAE,IAAI7O,IAAI,GAAGA,IAAI,CAAC,IAAI6O,EAAE,IAAI7O,GAAGA,CAAC,KAAK,GAC1CyF,IAAIxF,IAAIA,IAAI6P,GACZF,IAAI,KAAK,KAAK,KAAK,IAAInK,CAAC,CAAC,GACzBoJ,EAAE,IAAI7O,GAAGA,GAAG6O,EAAE,IAAI7O,GAAGA,CAAC,IAAI0P,CAAO,GACjCb,EAAE,IAAI7O,IAAI,GAAGA,IAAI,GAAG6O,EAAE,IAAI7O,IAAI,GAAGA,IAAI,CAAC,IAAI0P,CAAO,GACjDlS,IAAIqR,EAAE,IAAI7O,GAAGA,CAAC,GAEVyF,KAAK,GAAG;AAiBV,eAhBAmK,IAAI3P,KAAK,IAAIA,IAAI2P,IAAI3P,IAAI2P,GACzB/C,EAAE7M,IAAI,CAAC,IAAIxC,IAAIoS,GACf/C,EAAE7M,CAAC,IAAI6M,EAAE7M,IAAI,CAAC,GACV4P,MAAM,MACR/C,EAAE7M,CAAC,IAAIxC,IAAIsS,IAAIF,IAEjBxO,EAAEpB,IAAI,CAAC,IAAI,GACXoB,EAAEpB,CAAC,IAAI,GACPxC,IAAIqR,EAAE,IAAI7O,GAAGA,IAAI,CAAC,GAClBiB,IAAI,KAAK,IAAIzD,CAAC,IAAI,KAAK,IAAIoS,CAAC,GAC5B3P,IAAIzC,IAAIyD,GACRwE,IAAImK,IAAI3O,GACR6D,IAAI,KAAK,KAAK7E,IAAIA,IAAIwF,IAAIA,CAAC,GAC3BxF,IAAIA,IAAI6E,GACRW,IAAIA,IAAIX,GAEH1K,IAAI4F,IAAI,GAAG5F,IAAIqV,GAAIrV;AACtB,YAAAwV,IAAIf,EAAE,IAAI7O,IAAI,GAAG5F,CAAC,GAClByU,EAAE,IAAI7O,IAAI,GAAG5F,GAAGqL,IAAImK,IAAI3P,IAAI4O,EAAE,IAAI7O,GAAG5F,CAAC,CAAC,GACvCyU,EAAE,IAAI7O,GAAG5F,GAAGqL,IAAIoJ,EAAE,IAAI7O,GAAG5F,CAAC,IAAI6F,IAAI2P,CAAC;AAGrC,eAAKzV,IAAI,GAAGA,KAAK6F,GAAG7F;AAClB,YAAAyV,IAAIf,EAAE,IAAI1U,GAAG6F,IAAI,CAAC,GAClB6O,EAAE,IAAI1U,GAAG6F,IAAI,GAAGyF,IAAImK,IAAI3P,IAAI4O,EAAE,IAAI1U,GAAG6F,CAAC,CAAC,GACvC6O,EAAE,IAAI1U,GAAG6F,GAAGyF,IAAIoJ,EAAE,IAAI1U,GAAG6F,CAAC,IAAIC,IAAI2P,CAAC;AAGrC,eAAKzV,IAAIoV,GAAKpV,KAAKqV,GAAMrV;AACvB,YAAAyV,IAAIpF,EAAE,IAAIrQ,GAAG6F,IAAI,CAAC,GAClBwK,EAAE,IAAIrQ,GAAG6F,IAAI,GAAGyF,IAAImK,IAAI3P,IAAIuK,EAAE,IAAIrQ,GAAG6F,CAAC,CAAC,GACvCwK,EAAE,IAAIrQ,GAAG6F,GAAGyF,IAAI+E,EAAE,IAAIrQ,GAAG6F,CAAC,IAAIC,IAAI2P,CAAC;AAAA,QAEvC;AACE,UAAA/C,EAAE7M,IAAI,CAAC,IAAIxC,IAAIyC,GACf4M,EAAE7M,CAAC,IAAIxC,IAAIyC,GACXmB,EAAEpB,IAAI,CAAC,IAAI4P,GACXxO,EAAEpB,CAAC,IAAI,CAAC4P;AAGV,QAAA5P,IAAIA,IAAI,GACR6P,IAAO;AAAA,MACT,OAAO;AASL,YARArS,IAAIqR,EAAE,IAAI7O,GAAGA,CAAC,GACduE,IAAI,GACJuL,IAAI,GACA7Q,IAAIe,MACNuE,IAAIsK,EAAE,IAAI7O,IAAI,GAAGA,IAAI,CAAC,GACtB8P,IAAIjB,EAAE,IAAI7O,GAAGA,IAAI,CAAC,IAAI6O,EAAE,IAAI7O,IAAI,GAAGA,CAAC,IAGlC6P,MAAS,IAAI;AAEf,eADAH,KAAWlS,GACNrD,IAAIoV,GAAKpV,KAAK6F,GAAG7F;AACpB,YAAA0U,EAAE,IAAI1U,GAAGA,GAAG0U,EAAE,IAAI1U,GAAGA,CAAC,IAAIqD,CAAC;AAE7B,UAAAyD,IAAI,KAAK,IAAI4N,EAAE,IAAI7O,GAAGA,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI6O,EAAE,IAAI7O,IAAI,GAAGA,IAAI,CAAC,CAAC,GAE5DxC,IAAI+G,IAAI,OAAOtD,GACf6O,IAAI,UAAU7O,IAAIA;AAAA,QACpB;AAEA,YAAI4O,MAAS,OACX5O,KAAKsD,IAAI/G,KAAK,GACdyD,IAAIA,IAAIA,IAAI6O,GACR7O,IAAI,IAAG;AAMT,eALAA,IAAI,KAAK,KAAKA,CAAC,GACXsD,IAAI/G,MACNyD,IAAI,CAACA,IAEPA,IAAIzD,IAAIsS,MAAMvL,IAAI/G,KAAK,IAAIyD,IACtB9G,IAAIoV,GAAKpV,KAAK6F,GAAG7F;AACpB,YAAA0U,EAAE,IAAI1U,GAAGA,GAAG0U,EAAE,IAAI1U,GAAGA,CAAC,IAAI8G,CAAC;AAE7B,UAAAyO,KAAWzO,GAEXzD,IAAI+G,IAAIuL,IAAI;AAAA,QACd;AAMF,aAHAD,IAAOA,IAAO,GAEd9P,IAAIC,IAAI,GACDD,KAAKd,MACV2Q,IAAIf,EAAE,IAAI9O,GAAGA,CAAC,GACd+E,IAAItH,IAAIoS,GACR3O,IAAIsD,IAAIqL,GACR3P,KAAK6E,IAAI7D,IAAI6O,KAAKjB,EAAE,IAAI9O,IAAI,GAAGA,CAAC,IAAI8O,EAAE,IAAI9O,GAAGA,IAAI,CAAC,GAClD0F,IAAIoJ,EAAE,IAAI9O,IAAI,GAAGA,IAAI,CAAC,IAAI6P,IAAI9K,IAAI7D,GAClC6D,IAAI+J,EAAE,IAAI9O,IAAI,GAAGA,IAAI,CAAC,GACtBkB,IAAI,KAAK,IAAIhB,CAAC,IAAI,KAAK,IAAIwF,CAAC,IAAI,KAAK,IAAIX,CAAC,GAC1C7E,IAAIA,IAAIgB,GACRwE,IAAIA,IAAIxE,GACR6D,IAAIA,IAAI7D,GACJ,EAAAlB,MAAMd,KAIR,KAAK,IAAI4P,EAAE,IAAI9O,GAAGA,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI0F,CAAC,IAAI,KAAK,IAAIX,CAAC,KACrDiG,KACG,KAAK,IAAI9K,CAAC,KACR,KAAK,IAAI4O,EAAE,IAAI9O,IAAI,GAAGA,IAAI,CAAC,CAAC,IAC3B,KAAK,IAAI6P,CAAC,IACV,KAAK,IAAIf,EAAE,IAAI9O,IAAI,GAAGA,IAAI,CAAC,CAAC;AAIpC,UAAAA;AAGF,aAAK5F,IAAI4F,IAAI,GAAG5F,KAAK6F,GAAG7F;AACtB,UAAA0U,EAAE,IAAI1U,GAAGA,IAAI,GAAG,CAAC,GACbA,IAAI4F,IAAI,KACV8O,EAAE,IAAI1U,GAAGA,IAAI,GAAG,CAAC;AAIrB,aAAK,IAAI4F,GAAG,KAAKC,IAAI,MACnBmQ,IAAU,MAAMnQ,IAAI,GAChB,MAAMD,MACRE,IAAI4O,EAAE,IAAI,GAAG,IAAI,CAAC,GAClBpJ,IAAIoJ,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,GACtB/J,IAAIqL,IAAUtB,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,GACpCrR,IAAI,KAAK,IAAIyC,CAAC,IAAI,KAAK,IAAIwF,CAAC,IAAI,KAAK,IAAIX,CAAC,GACtCtH,MAAM,MACRyC,IAAIA,IAAIzC,GACRiI,IAAIA,IAAIjI,GACRsH,IAAIA,IAAItH,KAIRA,MAAM,IAdY;AAuBtB,cALAyD,IAAI,KAAK,KAAKhB,IAAIA,IAAIwF,IAAIA,IAAIX,IAAIA,CAAC,GAC/B7E,IAAI,MACNgB,IAAI,CAACA,IAGHA,MAAM,GAAG;AAcX,iBAbI,MAAMlB,IACR8O,EAAE,IAAI,GAAG,IAAI,GAAG,CAAC5N,IAAIzD,CAAC,IACbyB,MAAMc,KACf8O,EAAE,IAAI,GAAG,IAAI,GAAG,CAACA,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC,GAGlC5O,IAAIA,IAAIgB,GACRzD,IAAIyC,IAAIgB,GACRsD,IAAIkB,IAAIxE,GACR2O,IAAI9K,IAAI7D,GACRwE,IAAIA,IAAIxF,GACR6E,IAAIA,IAAI7E,GAEH7F,IAAI,GAAGA,IAAIqV,GAAIrV;AAClB,cAAA6F,IAAI4O,EAAE,IAAI,GAAGzU,CAAC,IAAIqL,IAAIoJ,EAAE,IAAI,IAAI,GAAGzU,CAAC,GAChC+V,MACFlQ,IAAIA,IAAI6E,IAAI+J,EAAE,IAAI,IAAI,GAAGzU,CAAC,GAC1ByU,EAAE,IAAI,IAAI,GAAGzU,GAAGyU,EAAE,IAAI,IAAI,GAAGzU,CAAC,IAAI6F,IAAI2P,CAAC,IAGzCf,EAAE,IAAI,GAAGzU,GAAGyU,EAAE,IAAI,GAAGzU,CAAC,IAAI6F,IAAIzC,CAAC,GAC/BqR,EAAE,IAAI,IAAI,GAAGzU,GAAGyU,EAAE,IAAI,IAAI,GAAGzU,CAAC,IAAI6F,IAAIsE,CAAC;AAGzC,iBAAKpK,IAAI,GAAGA,KAAK,KAAK,IAAI6F,GAAG,IAAI,CAAC,GAAG7F;AACnC,cAAA8F,IAAIzC,IAAIqR,EAAE,IAAI1U,GAAG,CAAC,IAAIoK,IAAIsK,EAAE,IAAI1U,GAAG,IAAI,CAAC,GACpCgW,MACFlQ,IAAIA,IAAI2P,IAAIf,EAAE,IAAI1U,GAAG,IAAI,CAAC,GAC1B0U,EAAE,IAAI1U,GAAG,IAAI,GAAG0U,EAAE,IAAI1U,GAAG,IAAI,CAAC,IAAI8F,IAAI6E,CAAC,IAGzC+J,EAAE,IAAI1U,GAAG,GAAG0U,EAAE,IAAI1U,GAAG,CAAC,IAAI8F,CAAC,GAC3B4O,EAAE,IAAI1U,GAAG,IAAI,GAAG0U,EAAE,IAAI1U,GAAG,IAAI,CAAC,IAAI8F,IAAIwF,CAAC;AAGzC,iBAAKtL,IAAIoV,GAAKpV,KAAKqV,GAAMrV;AACvB,cAAA8F,IAAIzC,IAAIgN,EAAE,IAAIrQ,GAAG,CAAC,IAAIoK,IAAIiG,EAAE,IAAIrQ,GAAG,IAAI,CAAC,GACpCgW,MACFlQ,IAAIA,IAAI2P,IAAIpF,EAAE,IAAIrQ,GAAG,IAAI,CAAC,GAC1BqQ,EAAE,IAAIrQ,GAAG,IAAI,GAAGqQ,EAAE,IAAIrQ,GAAG,IAAI,CAAC,IAAI8F,IAAI6E,CAAC,IAGzC0F,EAAE,IAAIrQ,GAAG,GAAGqQ,EAAE,IAAIrQ,GAAG,CAAC,IAAI8F,CAAC,GAC3BuK,EAAE,IAAIrQ,GAAG,IAAI,GAAGqQ,EAAE,IAAIrQ,GAAG,IAAI,CAAC,IAAI8F,IAAIwF,CAAC;AAAA,UAE3C;AAAA,MAEJ;AAAA,IACF;AAEA,QAAIkK,MAAS,GAIb;AAAA,WAAK3P,IAAIyP,IAAK,GAAGzP,KAAK,GAAGA;AAIvB,YAHAC,IAAI4M,EAAE7M,CAAC,GACPyF,IAAIrE,EAAEpB,CAAC,GAEHyF,MAAM;AAGR,eAFAxG,IAAIe,GACJ6O,EAAE,IAAI7O,GAAGA,GAAG,CAAC,GACR7F,IAAI6F,IAAI,GAAG7F,KAAK,GAAGA,KAAK;AAG3B,iBAFA2V,IAAIjB,EAAE,IAAI1U,GAAGA,CAAC,IAAI8F,GAClB6E,IAAI,GACC1K,IAAI6E,GAAG7E,KAAK4F,GAAG5F;AAClB,cAAA0K,IAAIA,IAAI+J,EAAE,IAAI1U,GAAGC,CAAC,IAAIyU,EAAE,IAAIzU,GAAG4F,CAAC;AAGlC,gBAAIoB,EAAEjH,CAAC,IAAI;AACT,cAAAyV,IAAIE,GACJ7O,IAAI6D;AAAA,qBAEJ7F,IAAI9E,GACAiH,EAAEjH,CAAC,MAAM,IACX0U,EAAE,IAAI1U,GAAG6F,GAAG8P,MAAM,IAAI,CAAChL,IAAIgL,IAAI,CAAChL,KAAKiG,IAAM4E,EAAK,KAEhDnS,IAAIqR,EAAE,IAAI1U,GAAGA,IAAI,CAAC,GAClBoK,IAAIsK,EAAE,IAAI1U,IAAI,GAAGA,CAAC,GAClBsL,KAAKoH,EAAE1S,CAAC,IAAI8F,MAAM4M,EAAE1S,CAAC,IAAI8F,KAAKmB,EAAEjH,CAAC,IAAIiH,EAAEjH,CAAC,GACxC+O,KAAK1L,IAAIyD,IAAI2O,IAAI9K,KAAKW,GACtBoJ,EAAE,IAAI1U,GAAG6F,GAAGkJ,CAAC,GACb2F,EAAE;AAAA,cACA1U,IAAI;AAAA,cACJ6F;AAAA,cACA,KAAK,IAAIxC,CAAC,IAAI,KAAK,IAAIoS,CAAC,KAAK,CAAC9K,IAAIgL,IAAI5G,KAAK1L,KAAK,CAACyD,IAAIsD,IAAI2E,KAAK0G;AAAA,YAC7E,IAGW1G,IAAI,KAAK,IAAI2F,EAAE,IAAI1U,GAAG6F,CAAC,CAAC,GACpB+K,IAAM7B,IAAIA,IAAI;AAChB,mBAAK9O,IAAID,GAAGC,KAAK4F,GAAG5F;AAClB,gBAAAyU,EAAE,IAAIzU,GAAG4F,GAAG6O,EAAE,IAAIzU,GAAG4F,CAAC,IAAIkJ,CAAC;AAAA,UAInC;AAAA,iBACSzD,IAAI;AAcb,eAbAxG,IAAIe,IAAI,GAEJ,KAAK,IAAI6O,EAAE,IAAI7O,GAAGA,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI6O,EAAE,IAAI7O,IAAI,GAAGA,CAAC,CAAC,KACtD6O,EAAE,IAAI7O,IAAI,GAAGA,IAAI,GAAGyF,IAAIoJ,EAAE,IAAI7O,GAAGA,IAAI,CAAC,CAAC,GACvC6O,EAAE,IAAI7O,IAAI,GAAGA,GAAG,EAAE6O,EAAE,IAAI7O,GAAGA,CAAC,IAAIC,KAAK4O,EAAE,IAAI7O,GAAGA,IAAI,CAAC,CAAC,MAEpDoQ,IAAUC,GAAK,GAAG,CAACxB,EAAE,IAAI7O,IAAI,GAAGA,CAAC,GAAG6O,EAAE,IAAI7O,IAAI,GAAGA,IAAI,CAAC,IAAIC,GAAGwF,CAAC,GAC9DoJ,EAAE,IAAI7O,IAAI,GAAGA,IAAI,GAAGoQ,EAAQ,CAAC,CAAC,GAC9BvB,EAAE,IAAI7O,IAAI,GAAGA,GAAGoQ,EAAQ,CAAC,CAAC,IAG5BvB,EAAE,IAAI7O,GAAGA,IAAI,GAAG,CAAC,GACjB6O,EAAE,IAAI7O,GAAGA,GAAG,CAAC,GACR7F,IAAI6F,IAAI,GAAG7F,KAAK,GAAGA,KAAK;AAG3B,iBAFA4V,IAAK,GACLC,IAAK,GACA5V,IAAI6E,GAAG7E,KAAK4F,GAAG5F;AAClB,cAAA2V,IAAKA,IAAKlB,EAAE,IAAI1U,GAAGC,CAAC,IAAIyU,EAAE,IAAIzU,GAAG4F,IAAI,CAAC,GACtCgQ,IAAKA,IAAKnB,EAAE,IAAI1U,GAAGC,CAAC,IAAIyU,EAAE,IAAIzU,GAAG4F,CAAC;AAKpC,gBAFA8P,IAAIjB,EAAE,IAAI1U,GAAGA,CAAC,IAAI8F,GAEdmB,EAAEjH,CAAC,IAAI;AACT,cAAAyV,IAAIE,GACJhL,IAAIiL,GACJ9O,IAAI+O;AAAA,qBAEJ/Q,IAAI9E,GACAiH,EAAEjH,CAAC,MAAM,KACXiW,IAAUC,GAAK,CAACN,GAAI,CAACC,GAAIF,GAAGrK,CAAC,GAC7BoJ,EAAE,IAAI1U,GAAG6F,IAAI,GAAGoQ,EAAQ,CAAC,CAAC,GAC1BvB,EAAE,IAAI1U,GAAG6F,GAAGoQ,EAAQ,CAAC,CAAC,MAEtB5S,IAAIqR,EAAE,IAAI1U,GAAGA,IAAI,CAAC,GAClBoK,IAAIsK,EAAE,IAAI1U,IAAI,GAAGA,CAAC,GAClB8V,KAAMpD,EAAE1S,CAAC,IAAI8F,MAAM4M,EAAE1S,CAAC,IAAI8F,KAAKmB,EAAEjH,CAAC,IAAIiH,EAAEjH,CAAC,IAAIsL,IAAIA,GACjDyK,KAAMrD,EAAE1S,CAAC,IAAI8F,KAAK,IAAIwF,GAClBwK,MAAO,KAAKC,MAAO,MACrBD,IACElF,IACA4E,KACC,KAAK,IAAIG,CAAC,IACT,KAAK,IAAIrK,CAAC,IACV,KAAK,IAAIjI,CAAC,IACV,KAAK,IAAI+G,CAAC,IACV,KAAK,IAAIqL,CAAC,KAEhBQ,IAAUC;AAAA,cACR7S,IAAIsH,IAAI8K,IAAIG,IAAKtK,IAAIuK;AAAA,cACrBxS,IAAIyD,IAAI2O,IAAII,IAAKvK,IAAIsK;AAAA,cACrBE;AAAA,cACAC;AAAA,YACf,GACarB,EAAE,IAAI1U,GAAG6F,IAAI,GAAGoQ,EAAQ,CAAC,CAAC,GAC1BvB,EAAE,IAAI1U,GAAG6F,GAAGoQ,EAAQ,CAAC,CAAC,GAClB,KAAK,IAAI5S,CAAC,IAAI,KAAK,IAAIoS,CAAC,IAAI,KAAK,IAAInK,CAAC,KACxCoJ,EAAE;AAAA,cACA1U,IAAI;AAAA,cACJ6F,IAAI;AAAA,eACH,CAAC+P,IAAKD,IAAIjB,EAAE,IAAI1U,GAAG6F,IAAI,CAAC,IAAIyF,IAAIoJ,EAAE,IAAI1U,GAAG6F,CAAC,KAAKxC;AAAA,YACjE,GACeqR,EAAE;AAAA,cACA1U,IAAI;AAAA,cACJ6F;AAAA,eACC,CAACgQ,IAAKF,IAAIjB,EAAE,IAAI1U,GAAG6F,CAAC,IAAIyF,IAAIoJ,EAAE,IAAI1U,GAAG6F,IAAI,CAAC,KAAKxC;AAAA,YACjE,MAEe4S,IAAUC;AAAA,cACR,CAACvL,IAAIP,IAAIsK,EAAE,IAAI1U,GAAG6F,IAAI,CAAC;AAAA,cACvB,CAACiB,IAAIsD,IAAIsK,EAAE,IAAI1U,GAAG6F,CAAC;AAAA,cACnB4P;AAAA,cACAnK;AAAA,YACjB,GACeoJ,EAAE,IAAI1U,IAAI,GAAG6F,IAAI,GAAGoQ,EAAQ,CAAC,CAAC,GAC9BvB,EAAE,IAAI1U,IAAI,GAAG6F,GAAGoQ,EAAQ,CAAC,CAAC,KAI9BlH,IAAI,KAAK,IAAI,KAAK,IAAI2F,EAAE,IAAI1U,GAAG6F,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI6O,EAAE,IAAI1U,GAAG6F,CAAC,CAAC,CAAC,GACzD+K,IAAM7B,IAAIA,IAAI;AAChB,mBAAK9O,IAAID,GAAGC,KAAK4F,GAAG5F;AAClB,gBAAAyU,EAAE,IAAIzU,GAAG4F,IAAI,GAAG6O,EAAE,IAAIzU,GAAG4F,IAAI,CAAC,IAAIkJ,CAAC,GACnC2F,EAAE,IAAIzU,GAAG4F,GAAG6O,EAAE,IAAIzU,GAAG4F,CAAC,IAAIkJ,CAAC;AAAA,UAInC;AAIJ,WAAK/O,IAAI,GAAGA,IAAIsV,GAAItV;AAClB,YAAIA,IAAIoV,KAAOpV,IAAIqV;AACjB,eAAKpV,IAAID,GAAGC,IAAIqV,GAAIrV;AAClB,YAAAoQ,EAAE,IAAIrQ,GAAGC,GAAGyU,EAAE,IAAI1U,GAAGC,CAAC,CAAC;AAK7B,WAAKA,IAAIqV,IAAK,GAAGrV,KAAKmV,GAAKnV;AACzB,aAAKD,IAAIoV,GAAKpV,KAAKqV,GAAMrV,KAAK;AAE5B,eADAyV,IAAI,GACC,IAAIL,GAAK,KAAK,KAAK,IAAInV,GAAGoV,CAAI,GAAG;AACpC,YAAAI,IAAIA,IAAIpF,EAAE,IAAIrQ,GAAG,CAAC,IAAI0U,EAAE,IAAI,GAAGzU,CAAC;AAElC,UAAAoQ,EAAE,IAAIrQ,GAAGC,GAAGwV,CAAC;AAAA,QACf;AAAA;AAAA,EAEJ;AAEA,WAASS,GAAKC,GAAIC,GAAIC,GAAIC,GAAI;AAC5B,QAAI3L,GAAG+H;AACP,WAAI,KAAK,IAAI2D,CAAE,IAAI,KAAK,IAAIC,CAAE,KAC5B3L,IAAI2L,IAAKD,GACT3D,IAAI2D,IAAK1L,IAAI2L,GACN,EAAEH,IAAKxL,IAAIyL,KAAM1D,IAAI0D,IAAKzL,IAAIwL,KAAMzD,CAAC,MAE5C/H,IAAI0L,IAAKC,GACT5D,IAAI4D,IAAK3L,IAAI0L,GACN,EAAE1L,IAAIwL,IAAKC,KAAM1D,IAAI/H,IAAIyL,IAAKD,KAAMzD,CAAC;AAAA,EAEhD;AAAA,EAEA,MAAM6D,GAAsB;AAAA,IAC1B,YAAY1V,GAAO;AAEjB,UADAA,IAAQ4N,EAAgB,YAAY5N,CAAK,GACrC,CAACA,EAAM;AACT,cAAM,IAAI,MAAM,yBAAyB;AAG3C,UAAIkK,IAAIlK,GACJ2V,IAAYzL,EAAE,MACdjG,IAAI,IAAIlE,EAAO4V,GAAWA,CAAS,GACnCC,IAAmB,IACnBzW,GAAGC,GAAGsF;AAEV,WAAKtF,IAAI,GAAGA,IAAIuW,GAAWvW,KAAK;AAC9B,YAAIyS,IAAI;AACR,aAAKnN,IAAI,GAAGA,IAAItF,GAAGsF,KAAK;AACtB,cAAIuB,IAAI;AACR,eAAK9G,IAAI,GAAGA,IAAIuF,GAAGvF;AACjB,YAAA8G,KAAKhC,EAAE,IAAIS,GAAGvF,CAAC,IAAI8E,EAAE,IAAI7E,GAAGD,CAAC;AAE/B,UAAA8G,KAAKiE,EAAE,IAAI9K,GAAGsF,CAAC,IAAIuB,KAAKhC,EAAE,IAAIS,GAAGA,CAAC,GAClCT,EAAE,IAAI7E,GAAGsF,GAAGuB,CAAC,GACb4L,IAAIA,IAAI5L,IAAIA;AAAA,QACd;AAMA,aAJA4L,IAAI3H,EAAE,IAAI9K,GAAGA,CAAC,IAAIyS,GAElB+D,UAAqB/D,IAAI,IACzB5N,EAAE,IAAI7E,GAAGA,GAAG,KAAK,KAAK,KAAK,IAAIyS,GAAG,CAAC,CAAC,CAAC,GAChCnN,IAAItF,IAAI,GAAGsF,IAAIiR,GAAWjR;AAC7B,UAAAT,EAAE,IAAI7E,GAAGsF,GAAG,CAAC;AAAA,MAEjB;AAEA,WAAK,IAAIT,GACT,KAAK,mBAAmB2R;AAAA,IAC1B;AAAA,IAEA,qBAAqB;AACnB,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,MAAM5V,GAAO;AACX,MAAAA,IAAQ4N,EAAgB,YAAY5N,CAAK;AAEzC,UAAIiE,IAAI,KAAK,GACT0R,IAAY1R,EAAE;AAElB,UAAIjE,EAAM,SAAS2V;AACjB,cAAM,IAAI,MAAM,gCAAgC;AAElD,UAAI,KAAK,mBAAkB,MAAO;AAChC,cAAM,IAAI,MAAM,iCAAiC;AAGnD,UAAItH,IAAQrO,EAAM,SACd6V,IAAI7V,EAAM,MAAK,GACfb,GAAGC,GAAGsF;AAEV,WAAKA,IAAI,GAAGA,IAAIiR,GAAWjR;AACzB,aAAKtF,IAAI,GAAGA,IAAIiP,GAAOjP,KAAK;AAC1B,eAAKD,IAAI,GAAGA,IAAIuF,GAAGvF;AACjB,YAAA0W,EAAE,IAAInR,GAAGtF,GAAGyW,EAAE,IAAInR,GAAGtF,CAAC,IAAIyW,EAAE,IAAI1W,GAAGC,CAAC,IAAI6E,EAAE,IAAIS,GAAGvF,CAAC,CAAC;AAErD,UAAA0W,EAAE,IAAInR,GAAGtF,GAAGyW,EAAE,IAAInR,GAAGtF,CAAC,IAAI6E,EAAE,IAAIS,GAAGA,CAAC,CAAC;AAAA,QACvC;AAGF,WAAKA,IAAIiR,IAAY,GAAGjR,KAAK,GAAGA;AAC9B,aAAKtF,IAAI,GAAGA,IAAIiP,GAAOjP,KAAK;AAC1B,eAAKD,IAAIuF,IAAI,GAAGvF,IAAIwW,GAAWxW;AAC7B,YAAA0W,EAAE,IAAInR,GAAGtF,GAAGyW,EAAE,IAAInR,GAAGtF,CAAC,IAAIyW,EAAE,IAAI1W,GAAGC,CAAC,IAAI6E,EAAE,IAAI9E,GAAGuF,CAAC,CAAC;AAErD,UAAAmR,EAAE,IAAInR,GAAGtF,GAAGyW,EAAE,IAAInR,GAAGtF,CAAC,IAAI6E,EAAE,IAAIS,GAAGA,CAAC,CAAC;AAAA,QACvC;AAGF,aAAOmR;AAAA,IACT;AAAA,IAEA,IAAI,wBAAwB;AAC1B,aAAO,KAAK;AAAA,IACd;AAAA,EACH;AAAA,EAEC,MAAMC,GAAO;AAAA,IACX,YAAYxH,GAAG/P,IAAU,IAAI;AAC3B,MAAA+P,IAAIV,EAAgB,YAAYU,CAAC;AACjC,UAAI,EAAE,GAAAuC,EAAC,IAAKtS;AACZ,YAAM;AAAA,QACJ,aAAAwX,IAAc;AAAA,QACd,eAAAC,IAAgB;AAAA,QAChB,qBAAAC,IAAsB;AAAA,MAC7B,IAAS1X;AAEJ,UAAI2X;AACJ,UAAIrF,GAAG;AAML,YALI9S,EAAW,WAAW8S,CAAC,KAAK,OAAOA,EAAE,CAAC,KAAM,WAC9CA,IAAI9Q,EAAO,aAAa8Q,CAAC,IAEzBA,IAAIjD,EAAgB,YAAYiD,CAAC,GAE/BA,EAAE,SAASvC,EAAE;AACf,gBAAM,IAAI,MAAM,4CAA4C;AAE9D,QAAA4H,IAAIrF,EAAE,gBAAgB,CAAC;AAAA,MACzB;AACE,QAAAqF,IAAI5H,EAAE,gBAAgB,CAAC;AAGzB,UAAI6H,IAAO,GACPjI,GAAGzD,GAAGqK,GAAGsB;AAEb,eACMC,IAAU,GACdA,IAAUL,KAAiBG,IAAOF,GAClCI;AAEA,QAAAvB,IAAIxG,EAAE,UAAS,EAAG,KAAK4H,CAAC,EAAE,IAAIA,EAAE,UAAS,EAAG,KAAKA,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,GAC7DpB,IAAIA,EAAE,IAAIA,EAAE,KAAI,CAAE,GAElB5G,IAAII,EAAE,KAAKwG,CAAC,EAAE,IAAIA,EAAE,UAAS,EAAG,KAAKA,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,GAE7CuB,IAAU,MACZF,IAAOjI,EAAE,MAAK,EAAG,IAAIkI,CAAI,EAAE,IAAI,CAAC,EAAE,IAAG,IAEvCA,IAAOlI,EAAE,MAAK,GAEV2C,KACFpG,IAAIoG,EAAE,UAAS,EAAG,KAAK3C,CAAC,EAAE,IAAIA,EAAE,UAAS,EAAG,KAAKA,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,GAC7DzD,IAAIA,EAAE,IAAIA,EAAE,KAAI,CAAE,GAElByL,IAAIrF,EAAE,KAAKpG,CAAC,EAAE,IAAIA,EAAE,UAAS,EAAG,KAAKA,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,KAEjDyL,IAAIhI;AAIR,UAAI2C,GAAG;AACL,YAAI5L,IAAIqJ,EAAE,UAAS,EAAG,KAAKJ,CAAC,EAAE,IAAIA,EAAE,UAAS,EAAG,KAAKA,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;AACjE,QAAAjJ,IAAIA,EAAE,IAAIA,EAAE,KAAI,CAAE;AAClB,YAAIqR,IAAYhI,EAAE,MAAK,EAAG,IAAIJ,EAAE,MAAK,EAAG,KAAKjJ,EAAE,UAAS,CAAE,CAAC,GACvDsR,IAAWL,EAAE,UAAS,EAAG,KAAKhI,CAAC,EAAE,IAAIA,EAAE,UAAS,EAAG,KAAKA,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,GACpEsI,IAAY3F,EAAE,MAAK,EAAG;AAAA,UACxB3C,EAAE,MAAK,EAAG,KAAKqI,EAAS,IAAI,GAAG,CAAC,CAAC,EAAE,KAAK9L,EAAE,UAAS,CAAE;AAAA,QAC9D;AAEO,aAAK,IAAIyD,GACT,KAAK,IAAIjJ,EAAE,UAAS,GACpB,KAAK,IAAI6P,EAAE,UAAS,GACpB,KAAK,IAAIrK,GACT,KAAK,IAAIyL,GACT,KAAK,IAAIhI,EAAE,UAAS,EAAG,KAAKA,CAAC,GAC7B,KAAK,YAAYoI,GACjB,KAAK,YAAYE,GACjB,KAAK,QAAQD;AAAA,MACf;AACE,aAAK,IAAIzB,EAAE,UAAS,GACpB,KAAK,IAAI5G,EAAE,UAAS,EAAG,KAAKA,CAAC,EAAE,KAAI,GAC/B6H,IACF,KAAK,IAAI7H,EAAE,QAAQ,IAAI,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,IAEvC,KAAK,IAAIA,GAEX,KAAK,YAAYI,EAAE,IAAIJ,EAAE,KAAK4G,EAAE,UAAS,CAAE,CAAC;AAAA,IAEhD;AAAA,EACH;AAEChX,SAAAA,EAAO,iBAAiBgC,GACxBhC,EAAO,MAAM4X,IACb5X,EAAO,wBAAwB4X,IAC/B5X,EAAO,iBAAiBgP,IACxBhP,EAAO,MAAM0V,IACb1V,EAAO,0BAA0B0V,IACjC1V,EAAO,KAAKgQ,IACZhQ,EAAO,kBAAkBgQ,IACzBhQ,EAAO,SAASiC,GAChBjC,EAAO,4BAA4BqP,IACnCrP,EAAO,mBAAmBoP,IAC1BpP,EAAO,uBAAuBsP,IAC9BtP,EAAO,oBAAoBuP,IAC3BvP,EAAO,yBAAyByP,IAChCzP,EAAO,gBAAgBwP,IACvBxP,EAAO,sBAAsB0P,IAC7B1P,EAAO,gBAAgB2P,IACvB3P,EAAO,sBAAsB4P,IAC7B5P,EAAO,SAASgY,IAChBhY,EAAO,SAASgY,IAChBhY,EAAO,KAAK2Q,IACZ3Q,EAAO,kBAAkB2Q,IACzB3Q,EAAO,MAAM+Q,IACb/Q,EAAO,6BAA6B+Q,IACpC/Q,EAAO,kBAAkB+O,IACzB/O,EAAO,kBAAkB6P,IACzB7P,EAAO,kBAAkB8P,GACzB9P,EAAO,cAAcsV,IACrBtV,EAAO,aAAaiV,IACpBjV,EAAO,UAAUiC,GACjBjC,EAAO,cAAcyQ,IACrBzQ,EAAO,UAAU0T,IACjB1T,EAAO,qBAAqB2U,IAC5B3U,EAAO,gBAAgB8U,IACvB9U,EAAO,QAAQ4T,IACf5T,EAAO,OAAO+P,IACP/P;AACR;","x_google_ignoreList":[0]}