#include <bits/stdc++.h>
using namespace std;
long long cnt = 0;
long long timer = 0;
set<long long> s;
vector<pair<long long, long long> > vp;
long long factorial(long long n) {
  return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
bool sortByVal(const pair<long long, pair<long long, long long> > &a,
               const pair<long long, pair<long long, long long> > &b) {
  return (a.first > b.first);
}
long long Powb(long long b, long long n) {
  if (n == 0) return 1LL;
  if (n == 1) return b;
  long long temp = Powb(b, n / 2);
  if (n % 2 == 0) {
    return (temp * temp) % 1000000007LL;
  } else {
    return (b * ((temp * temp) % 1000000007LL)) % 1000000007LL;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  cin >> t;
  while (t--) {
    long long n, k, i = 0, j = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0,
                    sum = 0, maxi = 0, to = 0;
    cin >> n >> k;
    vector<long long> a(n), b, p;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    };
    for (i = 0; i < n; i++) {
      if (a[i] > k) {
        b.push_back(a[i] - k);
      } else if (a[i] < k) {
        p.push_back(k - a[i]);
      } else {
        c = 1000000007LL;
      }
    }
    for (i = 0; i < b.size(); i++) {
      sum += b[i];
    }
    for (i = 0; i < p.size(); i++) {
      maxi += p[i];
    }
    if (sum == maxi) {
      if (sum == 0)
        cout << 0 << "\n";
      else
        cout << 1 << "\n";
    } else {
      if (c == 1000000007LL)
        cout << 1 << "\n";
      else
        cout << 2 << "\n";
    }
  }
}
