#include <bits/stdc++.h>
using namespace std;
char alphz[27] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
                  'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
                  's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
float Euclidean(long long x1, long long x2, long long y1, long long y2) {
  return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
long long GCD(long long a, long long b) { return !b ? a : GCD(b, a % b); }
long long LCM(long long a, long long b) { return (a * b) / GCD(a, b); }
void PrimeFactor(long long n) {
  while (n % 2 == 0) {
    n /= 2;
  }
  for (int i = 3; i <= sqrt(n); i += 2) {
    if (n % i == 0) {
      n /= i;
    }
  }
  if (n > 2) {
  };
}
bool Is_Square(long long x) {
  long long l = 0, r = x;
  while (l <= r) {
    long long mid = l + (r - l) / 2;
    if (mid * mid == x) return true;
    if (mid * mid > x)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return false;
}
long long Power(long long x, long long y) {
  long long temp;
  if (y == 0) return 1;
  temp = Power(x, y / 2);
  if (y % 2 == 0)
    return (temp * temp);
  else
    return (x * temp * temp);
}
bool Is_Prime(int x) {
  if (x == 2)
    return 1;
  else if (x % 2 == 0 || x < 2)
    return 0;
  for (int i = 3; i * i <= x; i += 2)
    if (x % i == 0) return 0;
  return 1;
}
bool Is_Palin(string s) {
  int i = 0, j = (int)s.size() - 1;
  while (i < j) {
    if (s[i] != s[j]) return 0;
    i++, j--;
  }
  return 1;
}
const int NN = 4e+5;
int seg[NN];
int arr[NN];
void build(int low, int hig, int pos) {
  if (low = hig)
    seg[pos] = arr[low];
  else {
    int mid = low + (hig - low) / 2;
    build(low, mid, pos * 2);
    build(mid + 1, hig, 2 * pos + 1);
    seg[pos] = seg[2 * pos] + seg[2 * pos + 1];
  }
}
void update(int low, int hig, int idx, int val, int pos) {
  if (low == hig)
    arr[idx] += val, seg[pos] += val;
  else {
    int mid = low + (hig - low) / 2;
    if (idx >= low && idx <= mid) {
      update(low, mid, idx, val, 2 * pos);
    } else
      update(mid + 1, hig, idx, val, 2 * pos + 1);
    seg[pos] = seg[2 * pos] + seg[2 * pos + 1];
  }
}
int query(int low, int hig, int l, int r, int pos) {
  if (l > hig || r < low) return 0;
  if (l <= low && hig <= r)
    return seg[pos];
  else {
    int mid = low + (hig - low) / 2;
    int p1 = query(low, mid, l, r, 2 * pos);
    int p2 = query(mid + 1, hig, l, r, 2 * pos + 1);
    return (p1 + p2);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int test;
  cin >> test;
  while (test--) {
    int n, t;
    cin >> n >> t;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<int> ans(n);
    map<int, int> mpp;
    for (int i = 0; i < n; i++) {
      if (mpp[a[i]] == 0) {
        mpp[t - a[i]] = 1;
        ans[i] = 1;
      } else {
        mpp[t - a[i]] = 0;
        ans[i] = 0;
      }
    }
    for (int i = 0; i < n; i++) cout << ans[i] << " ";
    cout << '\n';
  }
  return 0;
}
