#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

//#define int long long
//using ll = boost::multiprecision::cpp_int;
using ll = long long;
//const int INF = 1e9;//INT_MAX=1<<31-1=2147483647
const ll INF = (ll)1e18;//1<<63-1=9223372036854775807
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
#ifdef LOCAL_ENV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#define p(var) std::cout<<var<<std::endl
#define PI (acos(-1))
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(a) (a).begin(), (a).end()
#define pb push_back
inline bool isnatural(double a) { return a>=0 && ceil(a)==floor(a); }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2>inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2>inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){
		s << v[i]; if (i < len - 1) s << "\t";
	}
	return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){
		s << vv[i] << endl;
	}
	return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl;
	for (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr){
		s << "\t" << (*itr).first << " : " << (*itr).second << endl;
	}
	s << "}" << endl;
	return s;
}

/*-----8<-----8<-----*/

class Edge {
public:
	ll from,to,cost;
	Edge() {}
	Edge(ll from, ll to, ll cost) : from(from), to(to), cost(cost) {}
};

/*
引数
 start:探索するスタートノード番号
 node_size:ノードの数、0〜(node_size-1)がノード番号として定義される
戻り値
　dist:スタートノードから各頂点までの距離
　prev:最短路木の親頂点
　return:負閉路が存在しない(グラフが正常)のとき true，負閉路が存在するとき false
*/
bool bellman_ford(const vector<vector<Edge>> &g, ll start, vector<ll> &dist, vector<ll> &prev) {
	ll gsize = g.size();
	dist.assign(gsize, INF+INF); dist[start] = 0;
	prev.assign(gsize, -1);
	
	bool negative_cycle = false;
	for(ll k=0;k<gsize;k++){
		for(ll i=0;i<gsize;i++){
			for(auto e=(g[i]).begin(); e!=(g[i]).end(); e++){
				if (dist[e->to] > dist[e->from] + e->cost) {
					dist[e->to] = dist[e->from] + e->cost;
					prev[e->to] = e->from;
					if (k == gsize-1) {
						dist[e->to] = -INF;
						negative_cycle = true;
					}
				}
			}
		}
	}
	return !negative_cycle;
}
//最短路木の親頂点を元にstart->goalの経路を作成
vector<ll> buildPath(const vector<ll> &prev, ll goal) {
	vector<ll> path;
	for (ll u = goal; u >= 0; u = prev[u])
		path.push_back(u);
	reverse(path.begin(), path.end());
	return path;
}


signed main() {
	ll H,W;
	cin>>H>>W;

	//node_size:ノードの数、0〜(node_size-1)がノード番号として定義される
	//edges_size:与えられるEdgeの数
	ll node_size;
	node_size=10;
	vector<vector<Edge>> g(node_size,vector<Edge>());
	rep(i,10){
		rep(j,10){
			ll t;
			cin>>t;
			if(i==j)continue;
			Edge e=Edge(i,j,t);
			g[e.from].push_back(e);
		}
	}	

	vector<ll> cost(10,0);
	rep(i,10){
		if(i==1)continue;
		vector<ll> dist, prev;
		bellman_ford(g,i,dist,prev);
		cost[i]=dist[1];
	}

	ll ans=0;
	rep(i,H){
		rep(j,W){
			ll t;
			cin>>t;
			if(t==1 || t==-1)continue;
			ans+=cost[t];
		}
	}
	p(ans);
	return 0;
}


Measured memory_bytes: 256