M1

#include <bits/stdc++.h>

using namespace std;

#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define Pair pair < int, int >
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x: v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
    for (const T &x: v) out << x << ' ';
    return out;
}

void AhMeD_HoSSaM(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    freopen("shop.in", "r", stdin);
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
    #endif*/
}

constexpr int MAXN = 1e7;
vector < ll > factors, spf;

void sieve(){
    spf.assign(MAXN + 10, 0);
    factors.assign(MAXN + 10, -1);
    factors[1] = 1;
    spf[1] = 1;
    for (ll i = 2; i <= MAXN; i++) spf[i] = i;
    for (ll i = 4; i <= MAXN; i += 2) spf[i] = 2;
    for (ll i = 3; i * i <= MAXN; i++){
        if (spf[i] == i){
            for (ll j = i * i; j <= MAXN; j += i)
                if (spf[j] == j) spf[j] = i;
        }
    }
}

ll getFactorization(ll x){
    ll cost = 0, new_x = x;
    if(factors[x] != -1 || x == 1) return factors[x];
    while (new_x != 1){
        if(factors[new_x] != -1) return factors[x] = cost + factors[new_x];
        cost += spf[new_x], new_x = new_x / spf[new_x];
    }
    return factors[x] = cost;
}

void build(){
    for(int i = 1; i <= MAXN; i++)
        factors[i] = getFactorization(i);
}

void Solve(){
    int n, x;
    cin >> n >> x;
    vector < ll > vec(n);
    cin >> vec;
    sort(all(vec), [&](ll a, ll b){
        return factors[a] < factors[b];
    });
    ll cnt = 0;
    for(auto& i : vec)
        if(factors[i] <= x)
            x -= factors[i], cnt++;
        else
            break;
    cout << cnt << "\n";
}

int main(){
    AhMeD_HoSSaM();
    int t;
    cin >> t;
    sieve();
    build();
    while(t--)
        Solve();
    return 0;
}