//#define debug //*******************************************************************************************************************************************

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// [Tips]
// XCodeでのEOF入力はCtrl+D
// ¥はAlt+\
// ansは結構INTの範囲2,147,483,647を超えることがあるのでlong long使っておいたほうが良い
// 2進数表示 = dout << static_cast<bitset<8> >(x)
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////




////////////////////////////////////////
//ABC079
////////////////////////////////////////


#ifdef debug
#include <chrono>
#endif

#include <iostream>
#include <algorithm> // next_permutation
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstring> //memcpy
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric> //accumulate
#include <map>
//#include <unordered_map> //hash func.
#include <fstream> //ifstream, ofstream
#include <iterator> //insert_iterator::inserter
#include <set>
#include <random>


//#define NDEBUG //If NDEBUG is defined before #include <cassert>, assert will be ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;


#define dout cout
//If u wanna output to a text file instead of standard output, plz define OUTPUTFILE.
#define OUTPUTFILE "output.txt" //************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif


#define din cin
//If u wanna input from a text file instead of standard input, plz define INPUTFROMTEXTFILEを.
//#define INPUTFILE "input.txt" //**************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scand(A) scanf("%d", &(A))
#define scans(A) scanf("%s", (A))
#define printd(A) dout << "%d\n", (A))
#define prints(A) dout << "%s\n", (A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define show(A,s,g) dout << #A << " = "; rep(__w, (s), (g)) {disP(A[__w]);} dout << endl
#define showi(A,s,g) dout << #A << " = "; rep(__w, (s), (g)) {disP(__w);} dout << endl
#define line  dout << "----------------\n"
#define line2 dout << "================\n"

#define sign(x) ((x)>0)-((x)<0) //x<0: -1, x=0: 0, x>0: +1
#define p(i) ((i)/2)
#define l(i) ((i)*2)
#define r(i) ((i)*2+1)
#define sibling(i) (i^1) //the other sibling of i (ex. 16^1 = 17, 17^1 = 16)
#define isRightChild(i) (i&1) // ex. 16&1 = 0, 17&1 = 1
#define isLeftChild(i) (!(i&1)) // ex. 16&1 = 1, 17&1 = 0


typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ull;

const int INF = (1LL<<31)-1;
const int NONE = -1;
//const ll INF_LL = (ll)9e18-1LL; //Be careful for overflow.
//const ull INF_ULL = (ull)1e19-1ULL;
//#define MOD 1000000007 //大きい素数の代表といえばこの人、10億7さん

//#define N_MAX 100010 //num of vertex or element
//#define M_MAX 124760 //num of edge
//#define DATA_MAX 1010


#define N 10
int d[N]; //min distance from 1
bool v[N];
priority_queue<ii> Q;


int c[N][N]; //cost

int H, W;
#define HW_MAX 200
int a[HW_MAX][HW_MAX]; //wall


void init() {
    
    rep(i,0,N) {
        d[i] = INF;
        v[i] = false;
    }
    
    
}







void display() {
#ifdef debug
    dout << "------------------------- display() ---------------------\n";
    
    //    dout << "   "; showi(j,0,N);
    //    dout << "C[][] = \n";
    //    rep(i,0,N) {
    //        disP(i); dout << " : ";
    //        rep(j,0,N) {
    //            disP(c[i][j]);
    //        }
    //        dout << endl;
    //    }
    //    dout << endl;
    
    dout << "   "; showi(j,0,N);
    dout << "c[][] = \n";
    rep(i,0,N) {
        disP(i); dout << " : ";
        rep(j,0,N) {
            disP(c[i][j]);
        }
        dout << endl;
    }
    dout << endl;
    
    line;
    
    dout << "   "; showi(j,0,W);
    dout << "a[][] = \n";
    rep(i,0,H) {
        disP(i); dout << " : ";
        rep(j,0,W) {
            disP(a[i][j]);
        }
        dout << endl;
    }
    dout << endl;
    
    
    showi(i,0,N);
    show(d,0,N);
    show(v,0,N);
    
    
    dout << "------------------------- end of display() ---------------------\n";
#endif
}







ll solve_a() {
    
#ifdef debug
    line2;
    dout << "solve_a()\n";
#endif
    
    init();
    
    //calc. d[] by dijkstra algorithm
    d[1] = 0;
    v[1] = true;
    
    int s = 1;
    while(1) {
        
#ifdef debug
        line;
        disp(s);
#endif
        
        v[s] = true;
        
        int next_s = NONE;
        int d_of_next_s = INF;
        
        rep(i,0,N) {
            d[i] = min( d[i], d[s] + c[i][s] );
            
            if( v[i]==false and d[i]<d_of_next_s ) {
                next_s = i;
                d_of_next_s = d[i];
            }
        }
        
        display();
        
        if(next_s==NONE) break;
        
        s = next_s;
        
        
    } //end of while(1)-loop
    
    
    
    
    //calc. ans
    ll ans = 0;
    rep(i,0,H) {
        rep(j,0,W) {
            if(a[i][j]!=NONE)
                ans += d[a[i][j]];
#ifdef debug
            line;
            disp(a[i][j]);
            disp(ans);
#endif
        }
    }
    
    
    
    
    return ans;
    
}









ll solve_q() {
    
#ifdef debug
    line2;
    dout << "solve_q()\n";
#endif
    
    init();
    
    //calc. d[] by dijkstra algorithm
    d[1] = 0;
    Q.push(make_pair(-d[1], 1));
    
    int s;
    while(not Q.empty()) {
        
        ii x = Q.top(); Q.pop();
        s = x.second;
        
        if(v[s]==true) continue;
        
        v[s] = true;
        
#ifdef debug
        line;
        disp(s);
#endif
        
        rep(i,0,N) {
            d[i] = min( d[i], d[s] + c[i][s] );
            
            if( v[i]==false ) Q.push(make_pair(-d[i], i));
        }
        
        display();
        
    } //end of while(1)-loop
    
    
    
    
    //calc. ans
    ll ans = 0;
    rep(i,0,H) {
        rep(j,0,W) {
            if(a[i][j]!=NONE and a[i][j]!=1) {
                ans += d[a[i][j]];
                
#ifdef debug
                line;
                disp(a[i][j]);
                disp(ans);
#endif
                
            }
        }
    }
    
    
    
    return ans;
}











int main() {
    
    //cin, coutの高速化  ＊注意：cinを使うなら全部cinで、scanfを使うなら全部scanfで統一するように！
    cin.tie(0); //cinとcoutの同期を切る
    ios::sync_with_stdio(false); //iostreamとstdioの同期を切る
    
    
    //read input data
    int R = 0;
    
#ifdef debug
    cout << "Manual input: 0\n";
    cout << "Random input: 1\n";
    cin >> R;
#endif
    
    if(R) {
        random_device rnd;
        
        H = rnd()%HW_MAX+1;
        W = rnd()%HW_MAX+1;
        
        dout << H << " " << W << endl;
        
        rep(i,0,N) {
            rep(j,0,N) {
                c[i][j] = rnd()%N;
                dout << c[i][j] << " ";
            }
            dout << endl;
        }
        
        rep(i,0,H) {
            rep(j,0,W) {
                a[i][j] = rnd()%N;
                dout << a[i][j] << " ";
            }
            dout << endl;
        }
    }
    
    else {
        
#ifdef debug
        cout << "Plz enter input data\n";
#endif
        
        din >> H >> W;
        
        rep(i,0,N) {
            rep(j,0,N) {
                din >> c[i][j];
            }
        }
        
        rep(i,0,H) {
            rep(j,0,W) {
                din >> a[i][j];
            }
        }
    }
    
    
    display();
    
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //start timer
    auto startTime = chrono::system_clock::now();
#endif
    //------------------------------------------------------------------------------------------
    
    
    
    ll ans_a = solve_a();
//    disp(ans_a);
    
    
//    ll ans_q = solve_q();
//    disp(ans_q);
    
    
#ifdef debug
    cout << "=== OUTPUT ===\n";
#endif
    
//    cout << "ans_a = " << ans_a << endl;
//    cout << "ans_q = " << ans_q << endl;
    
    
//    if(ans_a!=ans_q) {
//        cout << "///////////////////////////////////////////////// BUG!! /////////////////////////////////////////////////////////\n";
//    }
    
    
    cout << ans_a << endl;
    
    
    
    
    
    
    
    
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //stop timer
    auto endTime = chrono::system_clock::now();
    auto dur = endTime - startTime;
    auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
    dout << fixed << setprecision(4) << (double)msec/1000 << " sec \n";
#ifdef OUTPUTFILE
    cout << fixed << setprecision(4) << (double)msec/1000 << " sec \n";
#endif
#endif
    //------------------------------------------------------------------------------------------
    
#ifdef INPUTFILE
    inputfile.close();
#endif
    
#ifdef OUTPUTFILE
    outputfile.close();
    dout << "\"" << OutputFilePath << "\"" << endl;
#endif
    
    return 0;
}






Measured memory_bytes: 384