import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container, std.typecons;
import std.numeric, std.math;
import core.bitop;

T RD(T = string)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T)(in string str) { return str.split.to!(T[]); }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool INSIDE(T)(T x, T b, T e) { return x >= b && x < e; }

long mod = pow(10, 9) + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

struct UnionFind
{
	void init(long n) { par = new long[](n); foreach (i; 0..n) par[i] = i; }
	long root(long i) { return par[i] == i ? i : (par[i] = root(par[i])); }
	bool same(long i, long j) { return root(i) == root(j); }
	void unite(long i, long j) { i = root(i); j = root(j); if (i == j) return; par[i] = j; }
	long[] par;
}

void main()
{
	auto H = RD!long;
	auto W = RD!long;
	auto c = new long[][](10);
	foreach (i; 0..10)
	{
		c[i] ~= RDR.split.to!(long[]);
	}
	auto A = new long[][](H);
	foreach (i; 0..H)
	{
		A[i] ~= RDR.split.to!(long[]);
	}

	auto bestCost = new long[](10);
	foreach (i; 0..10)
	{
		auto cost = new long[](10);
		fill(cost, long.max);
		cost[i] = 0;
		long[] open = [i];
		while (!open.empty)
		{
			auto node = open.front;
			open.popFront;
			cost[1] = min(cost[1], cost[node] + c[node][1]);
			foreach (j; 0..10)
			{
				if (i == j || j == 1) continue;

				if (cost[node] + c[node][j] < cost[1] && cost[node] + c[node][j] < cost[j])
				{
					cost[j] = cost[node] + c[node][j];
					open ~= j;
				}
			}
		}
		bestCost[i] = cost[1];
	}

	long ans;
	foreach (i; 0..H)
	{
		foreach (j; 0..W)
		{
			if (abs(A[i][j]) == 1) continue;
			ans += bestCost[A[i][j]];
		}
	}

	writeln(ans);
	stdout.flush();
}