#include <cstdio>
#include <algorithm>
using namespace std;
const long long mod = 1e9 + 7;
const int maxn = 200000;
int prime[maxn + 10], tot, min_prime[maxn + 10];
bool np[maxn + 10];
long long inv[maxn + 10], invfac[maxn + 10], fac[maxn + 10];
void init() {
    np[1] = true;
    for (int i = 2; i <= maxn; i++) {
        if (!np[i]) {
            prime[++tot] = i;
            min_prime[i] = i;
        }
        for (int j = 1; j <= tot && 1ll * i * prime[j] <= maxn; j++) {
            np[i * prime[j]] = true;
            min_prime[i * prime[j]] = prime[j];
            if (i % prime[j] == 0) break;
        }
    }
    inv[1] = 1;
    for (int i = 2; i <= maxn; i++) {
        inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    }
    invfac[0] = 1;
    fac[0] = 1;
    for (int i = 1; i <= maxn; i++) {
        invfac[i] = invfac[i - 1] * inv[i] % mod;
        fac[i] = fac[i - 1] * i % mod;
    }
}
long long C(long long n, long long m) {
    if (m > n) {
        return 0;
    }
    return fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}
int n, k, l1, l2;
long long dp[100010][20], sum[100010][20];
long long sumc[20];
long long ans1, ans2, ans3, ans4;
int main() {
    init();
    scanf("%d%d%d%d", &n, &k, &l1, &l2);
    for (int i = 1; i <= k; i++) {
        if (k % i == 0) {
            ans1++;
        }
    }
    dp[1][0] = 1;
    for (int i = 0; i < 20; i++) {
        for (int j = 0; j < l1; j++) {
            sumc[i] += C(j, i);
        }
        sumc[i] %= mod;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 20; j++) {
            if (dp[i][j]) {
                dp[i][j] %= mod;
                sum[i][j] += dp[i][j] * i;
                sum[i][j] %= mod;
                for (int k = 2 * i; k <= n; k += i) {
                    dp[k][j + 1] += dp[i][j];
                    sum[k][j + 1] += sum[i][j];
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 20; j++) {
            ans2 += sumc[j] * dp[i][j] % mod;
        }
        ans2 %= mod;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < min(20, l2); j++) {
            ans3 += dp[i][j];
            ans4 += sum[i][j];
        }
        ans3 %= mod;
        ans4 %= mod;
    }
    printf("%lld %lld %lld %lld\n", ans1, ans2, ans3, ans4);
    return 0;
}