#include <bits/stdc++.h>
using namespace std;
void in() { return; }
template <typename T, typename... Types>
void in(T &a, Types &...b) {
  cin >> (a);
  in(b...);
}
void o() { return; }
template <typename T, typename... Types>
void o(T a, Types... b) {
  cout << (a);
  cout << ' ';
  o(b...);
}
bool sortin(const pair<long long int, long long int> &e,
            const pair<long long int, long long int> &f) {
  return (e.first < f.first);
}
bool POT(long long int x) { return x && (!(x & (x - 1))); }
long long int i, j, k, l, m, n, p, q, r, a, b, c, x, y, z, ts, mn = 1e18,
                                                               mod = 1e9 + 7;
long long int ar[250002], br[250002], xr[250002];
int main() {
  {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  };
  in(ts);
  for (long long int test = 0; test < ts; test++) {
    in(n, k);
    map<long long int, long long int> tem, xr;
    c = 0;
    for (long long int i = 0; i <= n - 1; i++) {
      in(ar[i]);
      x = k - ar[i];
      if (x < 0) {
        tem[ar[i]] = xr[i] = 1;
        continue;
      }
      if (x == ar[i]) {
        if (c % 2)
          xr[i] = 2;
        else
          xr[i] = 1;
        c++;
      } else {
        if (tem[ar[i]] == 0)
          tem[ar[i]] = xr[i] = 1;
        else
          xr[i] = tem[ar[i]];
        if (tem[x] == 0)
          tem[x] = xr[i] = 2;
        else
          xr[i] = tem[x];
      }
    }
    for (long long int i = 0; i <= n - 1; i++) o(xr[i] - 1);
    cout << endl;
  }
}
