#include <bits/stdc++.h>
using namespace std;
const int N = 8;
const int S = 1 << 5;
int f[N][N][40][S][2];
string mp[N];
inline void ChkMax(int &x, int y) {
    x = max(x, y);
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int Case;
    cin >> Case;
    while (Case--) {
        int n, m;
        cin >> m >> n;
        for (int i = 0; i < n; ++i) mp[i].resize(m);
        for (int j = 0; j < m; ++j) {
            string s;
            cin >> s;
            for (int i = 0; i < n; ++i) mp[i][j] = s[i];
        }
        for (int i = 0; i <= n; ++i)
            for (int j = 0; j < m; ++j)
                for (int k = 0; k <= n * m; ++k)
                    for (int s = 0; s < (1 << m); ++s)
                        for (int d = 0; d < 2; ++d)
                            f[i][j][k][s][d] = -1;
        f[0][0][0][0][0] = 0;
        for (int i = 0; i < n; ++i) {
            for (int k = 0; k <= n * m; ++k)
                for (int s = 0; s < (1 << m); ++s)
                    f[i][0][k][s][1] = -1;
            for (int j = 0; j < m; ++j) {
                int ni = i, nj = j + 1;
                if (nj == m) ni = i + 1, nj = 0;
                for (int k = 0; k <= n * m; ++k)
                    for (int s = 0; s < (1 << m); ++s)
                        for (int d = 0; d < 2; ++d) if (f[i][j][k][s][d] >= 0) {
                            int val = f[i][j][k][s][d];
                            ChkMax(f[ni][nj][k][s][d], val + d + ((s >> j) & 1));
                            if (mp[i][j] == '1') {
                                int sj = s >> j & 1;
                                { /* type \ */
                                    int ns = s, nd = d;
                                    if (d != sj) nd ^= 1, ns ^= 1 << j;
                                    ChkMax(f[ni][nj][k + 1][ns][nd], val + d + sj);
                                }
                                { /* type / */
                                    if (d == sj) {
                                        ChkMax(f[ni][nj][k + 1][s & ~(1 << j)][0], val + d);
                                        ChkMax(f[ni][nj][k + 1][s |  (1 << j)][1], val + d + 1);
                                    }
                                }
                            }
                        }
            }
        }
        for (int k = 0, cur = 0; k <= n * m; ++k) {
            ChkMax(cur, f[n][0][k][0][0]);
            cout << 4 * n * m - 2 * cur << ' ';
        }
        cout << '\n';
    }
    return 0;
}