#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

const int N = 200007;

int n, m;

struct BIT {
    #define lowbit(x) ((x) & (-(x)))
    int c[N];
    void reset() {rep(i, 0, n + m) c[i] = 0;}
    void upd(int p, int w) {
        for (; p < N; p += lowbit(p)) c[p] += w;
    }
    int sum(int p) {
        int ret = 0;
        for (; p; p -= lowbit(p)) ret += c[p];
        return ret;
    }
} bit;

int pos[N];

inline void work() {
    n = rd(); m = rd(); bit.reset();
    int tot = m + 1;
    rep(i, 1, n) pos[i] = m + i;
    rep(i, 1, m) {
        int x = rd();
        printf("%d", pos[x] - tot - bit.sum(pos[x]));
        bit.upd(pos[x], 1);
        pos[x] = --tot;
        putchar(i == m ? '\n' : ' ');
    }
}

int main() {
    per(t, rd(), 1) work();
    return 0;
}