#共T组数据
T=int(input())
for _  in range(T):
    #矩阵n*m
    n,m=map(int,input().split())
    juzhen=[[0]*(m+2) for _ in range(n+2)]
    for j in range(1,n+1):
        a=list(map(int,input().split()))
        for k in range(1,m+1):
            juzhen[j][k]=a[k-1]
    total=0
    flag=1
    #juzhen不是全部不能走
    while(flag>0):
        num=0
        x=0
        y=0
        for j in range(1,n+1):
            for k in range(1,m+1):
                if juzhen[j][k]>num:
                    num=juzhen[j][k]
                    x=j
                    y=k
        total+=num
        lst1=[-1,-1,-1,0,0,0,1,1,1]
        lst2=[-1,0,1,-1,0,1,-1,0,1]
        for i in range(9):
            juzhen[x+lst1[i]][y+lst2[i]]=0
        for j in range(1,n+1):
            for k in range(1,m+1):
                flag=max(flag,juzhen[j][k])
    print(total)