import java.util.*;
import java.io.*; 
import java.text.*;
//Solution Credits: Taranpreet Singh
public class Main{
    //SOLUTION BEGIN
    int n, m;
    void solve(int TC) throws Exception{
        n = ni(); m = ni();
        int[][] g = new int[n][m];
        for(int i = 0; i< n; i++){
            String s = n();
            for(int j = 0; j< m; j++)g[i][j] = s.charAt(j)-'0';
        }
        long[][] lr = new long[n][m], rl = new long[n][m];
        for(int i = 0; i< n; i++){
            for(int j = 0; j< m; j++){
                lr[i][j] = g[i][j]+(i>0&&j>0?lr[i-1][j-1]:0);
                rl[i][j] = g[i][j]+(i>0&&j<m-1?rl[i-1][j+1]:0);
            }
        }
        long[] ans = new long[n+m];
        for(int len = 1; len<= n+m-2; len++){
            for(int i = 0; i< n; i++){
                for(int j = 0; j< m; j++){
                    if(g[i][j]==0)continue;
                    long cur = 0;
                    cur+= getrl(rl, i, j-len)-getrl(rl, i-len-1, j+1);//rl[i-len-1][j+1];
                    cur+= getrl(rl, i+len, j)-getrl(rl, i-1, j+len+1);
                    cur+= getlr(lr, i, j+len)-getlr(lr, i-len-1, j-1);
                    cur+= getlr(lr, i+len, j)-getlr(lr, i-1, j-len-1);
                    if(i-len>=0 && g[i-len][j]==1)cur--;
                    if(j-len>=0 && g[i][j-len]==1)cur--;
                    if(i+len<n && g[i+len][j]==1)cur--;
                    if(j+len<m && g[i][j+len]==1)cur--;
                    ans[len]+=cur;
                }
            }
        }
        for(int i = 1; i<= n+m-2; i++)p(ans[i]/2+" ");pn("");
    }
    long getlr(long[][] lr, int x, int y){
        if(y-x>=m || x-y>=n)return 0;
        if(Math.min(x,y)<0)return 0;
        else if(x>=n || y>=m){
            int d = Math.max(x-n+1, y-m+1);
            x-=d;y-=d;
        }
        return lr[x][y];
    }
    long getrl(long[][] rl, int x, int y){
        if(x+y<0 || x+y>n+m-2)return 0;
        if(x<0 || y>=m)return 0;
        if(y<0){
            x+=y;y=0;
        }else if(x>=n){
            y+=(x-n+1);
            x=n-1;
        }
        return rl[x][y];
    }
    //SOLUTION ENDS
    long mod = (long)1e9+7, IINF = (long)1e17;
    final int MAX = (int)1e6+1, INF = (int)2e9, root = 3;
    DecimalFormat df = new DecimalFormat("0.000000000000");
    double PI = 3.1415926535897932384626433832792884197169399375105820974944, eps = 1e-8;
    static boolean multipleTC = true, memory = false;
    FastReader in;PrintWriter out;
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        int T = (multipleTC)?ni():1;
        //Solution Credits: Taranpreet Singh
        for(int i = 1; i<= T; i++)solve(i);
        out.flush();
        out.close();
    }
    public static void main(String[] args) throws Exception{
        if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
        else new Main().run();
    }
    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

    class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine(){
            String str = "";
            try{    
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }   
            return str;
        }
    }
}