{"problem":{"name":"Almost Multiplication Table","description":{"content":"There are positive integers $N, M$, and an $N \\times M$ positive integer matrix $A_{i, j}$. For two **(strictly) increasing** positive integer sequences $X = (X_1, \\ldots, X_N)$ and $Y = (Y_1, \\ldots,","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":3000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc061_d"},"statements":[{"statement_type":"Markdown","content":"There are positive integers $N, M$, and an $N \\times M$ positive integer matrix $A_{i, j}$. For two **(strictly) increasing** positive integer sequences $X = (X_1, \\ldots, X_N)$ and $Y = (Y_1, \\ldots, Y_M)$, we define the penalty $D(X, Y)$ as $\\max_{1 \\leq i \\leq N, 1 \\leq j \\leq M} |X_i Y_j - A_{i, j}|$.\nFind two **(strictly) increasing** positive integer sequences $X$ and $Y$ such that $D(X, Y)$ is the smallest possible.\n\n## Constraints\n\n*   $1 \\leq N, M \\leq 5$\n*   $1 \\leq A_{i, j} \\leq 10^9$ ($1 \\leq i \\leq N$, $1 \\leq j \\leq M$)\n*   All values in the input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$A_{1,1}$ $\\ldots$ $A_{1,M}$\n$\\vdots$\n$A_{N,1}$ $\\ldots$ $A_{N,M}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc061_d","tags":[],"sample_group":[["1 1\n853922530","0\n31415\n27182"],["3 3\n4 4 4\n4 4 4\n4 4 4","5\n1 2 3 \n1 2 3"],["3 4\n4674 7356 86312 100327\n8737 11831 145034 167690\n47432 66105 809393 936462","357\n129 216 1208 \n39 55 670 775"]],"created_at":"2026-03-03 11:01:14"}}