#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define mod 1000000007LL
using namespace std;

int N, K, L1, L2;
long long ans1 = 0, ans2 = 0, ans3 = 0, ans4 = 0;
int dp2[1003][1003];
int dp3[1003][1003];
int dp4[1003][1003];

long long solve1(){
	long long res = 0;
	if (K == 0) return 1LL * N;
	for (int i = 1; i <= K; i ++){
		if ((i % 1 == 0) && (K % i == 0)){
			res ++;
		}
	}
	return res;
}

long long solve2(){
	dp2[1][0] = 1;
	for (int i = 1; i <= N; i ++){
		for (int j = 0; j < L1; j ++){
			for (int k = 0; ; k ++){
				if (k * i > N) break;
				dp2[i * k][j + 1] += dp2[i][j];
				dp2[i * k][j + 1] %= mod;
			}
		}
	}
	long long res = 0;
	for (int i = 1; i <= L1; i ++){
		res += dp2[0][i];
	}
	return res;
}

long long solve3(){
	dp3[1][0] = 1;
	for (int i = 1; i <= N; i ++){
		for (int j = 0; j < L2; j ++){
			// cout << i << " " << j << " " << dp3[i][j] << ";;\n";
			for (int k = 0; ; k ++){
				if (k == 1) continue;
				if (k * i > N) break;
				dp3[i * k][j + 1] += dp3[i][j];
				dp3[i * k][j + 1] %= mod;
			}
		}
	}
	long long res = 0;
	for (int i = 1; i <= L2; i ++){
		res += dp3[0][i];
	}
	return res;
}

long long solve4(){
	dp4[1][0] = 1;
	for (int i = 1; i <= N; i ++){
		for (int j = 0; j < L2; j ++){
			// cout << i << " " << j << " " << dp4[i][j] << ";;\n";
			for (int k = 0; ; k ++){
				if (k == 1) continue;
				if (k * i > N) break;
				dp4[i * k][j + 1] += dp4[i][j] + dp3[i][j] * (i * k);
				dp4[i * k][j + 1] %= mod;
			}
		}
	}
	long long res = 0;
	for (int i = 1; i <= L2; i ++){
		// cout << 0 << " " << i << " " << dp4[0][i] << ";;\n";
		res += dp4[0][i];
	}
	return res;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d %d %d %d", &N, &K, &L1, &L2);
	ans1 = solve1() % mod;
	ans2 = solve2() % mod;
	ans3 = solve3() % mod;
	ans4 = solve4() % mod;
	printf("%lld %lld %lld %lld\n", ans1, ans2, ans3, ans4);
	
	return 0;
}