#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************

vector<int> spf;
vector<int> primes;

void seive(){
    spf.assign(N+1, 0);
    for(int i=2; i<=N; i++) spf[i] = i;

    for(int i=2; i*i<=N; i++){
        if(spf[i] != i) continue;
        for(int j=i*i; j<=N; j+=i){
            spf[j] = min(spf[j], i);
        }
    }
    for(int i=2; i<=100; i++){
        if(spf[i] == i) primes.push_back(i);
    }
}


vector<int> a;

//* Using spf to find factors of m!

vector<int> consistency1(int n, int m){

    unordered_map<int,int> mp;
    for(int i=2; i<=m; i++){
        int q = i;
        while(q>1){
            mp[spf[q]]++;
            q /= spf[q];
        }
    }

    vector<int> ans;
    for(auto& it : a){

        int x = it;
        while(x>1){
            mp[spf[x]]++;
            x /= spf[x];
        }

        int d = 1;
        for(auto& pe : mp){
            int e = pe.second;
            d = (d * (e+1))%M;
        }
        ans.push_back(d);

        x = it;
        while(x>1){
            mp[spf[x]]--;
            x /= spf[x];
        }
    }

    return ans;

}






//* Using legendre's formula to find factors of m!

vector<int> consistency2(int n, int m){

    unordered_map<int,int> mp;
    for(auto& p : primes){
        int q = p;
        while(m/q>0){
            mp[p] += m/q;
            q *= p;
        }
    }

    vector<int> ans;
    for(auto& it : a){

        int x = it;
        while(x>1){
            mp[spf[x]]++;
            x /= spf[x];
        }

        int d = 1;
        for(auto& pe : mp){
            int e = pe.second;
            d = (d * (e+1))%M;
        }
        ans.push_back(d);

        x = it;
        while(x>1){
            mp[spf[x]]--;
            x /= spf[x];
        }
    }

    return ans;

}
















vector<int> practice(int n, int m){


}





void solve() {
    static int _ = (seive(), 0);
    
    int n, m;
    cin>> n >> m;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans = consistency1(n, m);
    
    for(auto& it : ans) cout << it << " "; cout << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}