codeforces 1419C（贪心）

#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define sz(x) x.size()
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<char,char> PCC;
typedef long long ll;
typedef pair<ll,ll> PLL;
const int N=1e5+10;
const int M=1e5+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
int a[N];
void solve(){
    int n,x;cin>>n>>x;
    bool flag=false;
    int res=0,cnt=0;
    rep(i,0,n){
        cin>>a[i];
        res+=a[i];
        if(a[i]!=x) flag=true;
        else cnt++;
    }
    if(!flag){
        cout<<0<<endl;
        return;
    }
    if(cnt || n*x==res){
        cout<<1<<endl;
        return;
    }
    cout<<2<<endl;
}
int main(){
    IOS;
    //freopen("test.txt", "r", stdin);
    //freopen("test.txt", "w", stdout);
    int t;cin>>t;
    while(t--)
        solve();
    return 0;
}