#[test]
fn test_solve() {
    assert_eq!(solve("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\n"), "12\n");
    assert_eq!(solve("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\n"), "0\n");
    assert_eq!(solve("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\n"), "47\n");
}
fn solve(src: &str) -> String {
    let mut sc = Scanner::from_str(src);

    let h: usize = sc.read();
    let w: usize = sc.read();

    let mut ngb = vec![Vec::new(); 10];
    for i in 0..10 {
        for j in 0..10 {
            let c: usize = sc.read();
            ngb[j].push((i, c));
        }
    }
    let cst = shortest_paths_from(1, &ngb);
    let mut cnt = vec![0; 10];
    for _ in 0..h * w {
        let a: isize = sc.read();
        if a >= 0 {
            cnt[a as usize] += 1;
        }
    }
    format!(
        "{}\n",
        cnt.iter()
            .zip(cst.iter())
            .map(|(&cnt, &cst)| cnt * cst)
            .sum::<usize>()
    )
}
#[derive(PartialEq, Eq, Debug)]
struct Rev<T>(T);
impl<T: PartialOrd> PartialOrd for Rev<T> {
    fn partial_cmp(&self, other: &Rev<T>) -> Option<std::cmp::Ordering> {
        other.0.partial_cmp(&self.0)
    }
}
impl<T: Ord> Ord for Rev<T> {
    fn cmp(&self, other: &Rev<T>) -> std::cmp::Ordering {
        other.0.cmp(&self.0)
    }
}
fn shortest_paths_from(start: usize, neighbor: &[Vec<(usize, usize)>]) -> Vec<usize> {
    use std::collections::BinaryHeap;
    use std::iter::FromIterator;
    let n = neighbor.len();
    let mut dist = vec![usize::max_value() / 2; n];
    dist[start] = 0;
    let mut que: BinaryHeap<_> = FromIterator::from_iter(dist.iter().map(|&d| Rev(d)).zip(0..n));
    while let Some((Rev(d), u)) = que.pop() {
        for &(v, l) in &neighbor[u] {
            let alt = d + l;
            if dist[v] > alt {
                dist[v] = alt;
                que.push((Rev(alt), v));
            }
        }
    }
    dist
}
fn main() {
    let mut buf = String::new();
    use std::io::{Read, Write};
    std::io::stdin().read_to_string(&mut buf).unwrap();
    std::io::stdout().write_all(solve(&buf).as_bytes()).unwrap();
}
struct Scanner<'a>(std::str::SplitWhitespace<'a>);
impl<'a> Scanner<'a> {
    fn from_str(src: &str) -> Scanner {
        Scanner(src.split_whitespace())
    }
    fn get(&mut self) -> &str {
        self.0.next().unwrap()
    }
    fn read<T: std::str::FromStr>(&mut self) -> T {
        self.get().parse().ok().unwrap()
    }
}


Measured memory_bytes: 4352