{"raw_statement":[{"iden":"problem statement","content":"Joisino the magical girl has decided to turn every single digit that exists on this world into $1$.\nRewriting a digit $i$ with $j$ $(0≤i,j≤9)$ costs $c_{i,j}$ MP (Magic Points).\nShe is now standing before a wall. The wall is divided into $HW$ squares in $H$ rows and $W$ columns, and at least one square contains a digit between $0$ and $9$ (inclusive).\nYou are given $A_{i,j}$ that describes the square at the $i$\\-th row from the top and $j$\\-th column from the left, as follows:\n\n*   If $A_{i,j}≠-1$, the square contains a digit $A_{i,j}$.\n*   If $A_{i,j}=-1$, the square does not contain a digit.\n\nFind the minimum total amount of MP required to turn every digit on this wall into $1$ in the end."},{"iden":"constraints","content":"*   $1≤H,W≤200$\n*   $1≤c_{i,j}≤10^3$ $(i≠j)$\n*   $c_{i,j}=0$ $(i=j)$\n*   $-1≤A_{i,j}≤9$\n*   All input values are integers.\n*   There is at least one digit on the wall."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$H$ $W$\n$c_{0,0}$ $...$ $c_{0,9}$\n$:$\n$c_{9,0}$ $...$ $c_{9,9}$\n$A_{1,1}$ $...$ $A_{1,W}$\n$:$\n$A_{H,1}$ $...$ $A_{H,W}$"},{"iden":"sample input 1","content":"2 4\n0 9 9 9 9 9 9 9 9 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 9 9 9 9 9 9\n9 9 9 9 0 9 9 9 9 2\n9 9 9 9 9 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 9 9 0 9 9\n9 9 9 9 2 9 9 9 0 9\n9 2 9 9 9 9 9 9 9 0\n-1 -1 -1 -1\n8 1 1 8"},{"iden":"sample output 1","content":"12\n\nTo turn a single $8$ into $1$, it is optimal to first turn $8$ into $4$, then turn $4$ into $9$, and finally turn $9$ into $1$, costing $6$ MP.\nThe wall contains two $8$s, so the minimum total MP required is $6×2=12$."},{"iden":"sample input 2","content":"5 5\n0 999 999 999 999 999 999 999 999 999\n999 0 999 999 999 999 999 999 999 999\n999 999 0 999 999 999 999 999 999 999\n999 999 999 0 999 999 999 999 999 999\n999 999 999 999 0 999 999 999 999 999\n999 999 999 999 999 0 999 999 999 999\n999 999 999 999 999 999 0 999 999 999\n999 999 999 999 999 999 999 0 999 999\n999 999 999 999 999 999 999 999 0 999\n999 999 999 999 999 999 999 999 999 0\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1"},{"iden":"sample output 2","content":"0\n\nNote that she may not need to change any digit."},{"iden":"sample input 3","content":"3 5\n0 4 3 6 2 7 2 5 3 3\n4 0 5 3 7 5 3 7 2 7\n5 7 0 7 2 9 3 2 9 1\n3 6 2 0 2 4 6 4 2 3\n3 5 7 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 4 3\n3 6 2 3 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n2 1 3 4 5 7 8 6 4 0\n3 5 2 6 1\n2 5 3 2 1\n6 9 2 5 6"},{"iden":"sample output 3","content":"47"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}