import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format, std.datetime;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long H, W;
    scan(H, W);
    auto C = new long[][](10);
    foreach (i; 0 .. 10)
        C[i] = aryread();
    auto A = new long[](H * W);
    foreach (i; 0 .. H)
    {
        auto a = aryread();
        foreach (j; 0 .. W)
        {
            A[i * W + j] = a[j];
        }
    }
    foreach (k; 0 .. 10)
        foreach (i; 0 .. 10)
            foreach (j; 0 .. 10)
                if (C[i][k] + C[k][j] < C[i][j])
                    C[i][j] = C[i][k] + C[k][j];
    long ans;
    foreach (a; A)
        if (a != -1)
        {
            ans += C[a][1];
        }
    writeln(ans);
}
