SPFA AC
//============================================================================
// Name : Number Maze.cpp
// Date : 2013/4/29 下午4:56:03
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 1011
#define PII pair<int,int\>
#define PB push\_back
#define oo (1<<29)
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int dp\[M\]\[M\];
int mz\[M\]\[M\];
bool inqueue\[M\]\[M\];
int nx,ny;
int dx\[4\]={0,0,1,-1};
int dy\[4\]={1,-1,0,0};
struct data{
int x,y;
int v;
data(int xx,int yy,int vv){
x=xx;
y=yy;
v=vv;
}
};
struct cmp{
bool operator()(data &a,data &b){
return a.v>b.v;
}
};
void bfs(){
fill(&dp\[0\]\[0\],&dp\[M-1\]\[M-1\],oo);
Set(inqueue,false);
inqueue\[0\]\[0\]=true;
priority\_queue<data,vector<data>,cmp > pq;
pq.push(data(0,0,mz\[0\]\[0\]));
dp\[0\]\[0\]=mz\[0\]\[0\];
while(!pq.empty()){
int tmpx=pq.top().x;
int tmpy=pq.top().y;
int cost=pq.top().v;
inqueue\[tmpx\]\[tmpy\]=0;
if(tmpx==nx-1&&tmpy==ny-1){
printf("%d\\n",cost);
return;
}
pq.pop();
for(int i=0;i<4;i++){
int tox=tmpx+dx\[i\];
int toy=tmpy+dy\[i\];
if(tox<0||tox>=nx||toy<0||toy>=ny)continue;
if(dp\[tox\]\[toy\]>cost+mz\[tox\]\[toy\]){
dp\[tox\]\[toy\]=cost+mz\[tox\]\[toy\];
if(!inqueue\[tox\]\[toy\]){
pq.push(data(tox,toy,dp\[tox\]\[toy\]));
inqueue\[tox\]\[toy\]=true;
}
}
}
}
// for(int i=0;i<ny;i++){
// for(int j=0;j<nx;j++)printf("%d ",dp\[)
// }
}
int main() {
ios\_base::sync\_with\_stdio(0);
int test;
scanf("%d",&test);
while(test--){
scanf("%d%d",&ny,&nx);
for(int i=0;i<ny;i++){
for(int j=0;j<nx;j++){
scanf("%d",&mz\[j\]\[i\]);
}
}
bfs();
}
}