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

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;


void main() {
    int h, w;
    scan(h, w);

    auto c = new int[][](10, 10);
    iota(10).each!(i => c[i] = readln.split.to!(int[]));

    auto a = new int[][](h, w);
    iota(h).each!(i => a[i] = readln.split.to!(int[]));

    auto d = new int[][](10, 10);
    foreach (i ; 0 .. 10) {
        foreach (j ; 0 .. 10) {
            d[i][j] = c[i][j];
        }
    }

    foreach (k ; 0 .. 10) {
        foreach (i ; 0 .. 10) {
            foreach (j ; 0 .. 10) {
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }

    int ans;

    foreach (i ; 0 .. h) {
        foreach (j ; 0 .. w) {
            if (a[i][j] > -1) {
                ans += d[a[i][j]][1];
            }
        }
    }

    writeln(ans);
}









void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
