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

void scan(T...)(ref T args) {
    auto line = readln.split;
    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);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}


enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    int H, W;
    scan(H, W);
    auto c = iota(10).map!(i => readln.split.to!(int[])).array;
    foreach (k ; 0 .. 10) {
        foreach (i ; 0 .. 10) {
            foreach (j ; 0 .. 10) {
                chmin(c[i][j], c[i][k] + c[k][j]);
            }
        }
    }
    auto a = iota(H).map!(i => readln.split.to!(int[])).array;
    int ans;
    foreach (i ; 0 .. H) {
        foreach (j ; 0 .. W) {
            if (a[i][j] != -1) ans += c[a[i][j]][1];
        }
    }
    writeln(ans);
}
