#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

vector<int> consistency(int n){

    vector<int> aa;
    vector<int> bb;

    for(int i=0; i<n; i++){
        if(a[i] == 1 || a[i] == 3) aa.push_back(i);
        if(a[i] == 2 || a[i] == 3) bb.push_back(i);
    }

    int sz1 = aa.size();
    int sz2 = bb.size();

    vector<int> pfA(sz1+1), pfB(sz2+1);

    for(int i=1; i<=sz1; i++) pfA[i] = pfA[i-1] + aa[i-1];
    for(int i=1; i<=sz2; i++) pfB[i] = pfB[i-1] + bb[i-1];

    int tA = 0;
    for(int i=0; i<sz1; i++) tA += aa[i];

    int tB = 0;
    for(int i=0; i<sz2; i++) tB += bb[i];

    vector<int> ans(n);

    for(int i=0; i<n; i++){
        int lA = upper_bound(begin(aa), end(aa), i) - begin(aa) - 1 ;
        int lB = upper_bound(begin(bb), end(bb), i) - begin(bb) - 1 ;
        
        int ctA = lA+1;
        int scoreA = (ctA*i - pfA[lA+1]) + ( (tA - pfA[lA+1]) - (sz1-ctA)*i );
        
        
        int ctB = lB+1;
        int scoreB = (ctB*i - pfB[lB+1]) + ( (tB - pfB[lB+1]) - (sz2-ctB)*i ); 
        
        ans[i] = abs(scoreA - scoreB);        

    }




    return ans;

}















vector<int> practice(int n){


}





void solve() {
    
    int n, m;
    cin>> n >> m;
    
    a.resize(m);
    for(int i=0; i<m; i++) cin >> a[i];
    
    auto ans = consistency(m);
    for(auto& t : ans) cout << t << " "; cout << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}