#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,k,l1,l2;
vector <int> g[100010];
const int md = 1e9 + 7;
int dp[100111][22];
int oud[101111];
int qp(int x,int y) {
	if(y == 0) return 1;
	if(y == 1) return x % md;
	if(y % 2 == 0) {
		int w = qp(x,y / 2);
		return w * w % md;
	}
	else {
		int w = qp(x,y / 2);
		return w * w % md * x % md;
	}
	return 0;
}
int inv(int x) {return qp(x,md - 2) % md;}
int jc[101122];
int invjc[101111];
int played[25][101011];
int ans[101111][25];
signed main(){
	cin >> n >> k >> l1 >> l2;
	/* The first part */
	int ans1 = 0;
	for(int i = 1;i <= n;i ++)
	ans1 += (k % i == 0);
	cout << ans1 << " ";
	/* The second part */
	int ans2 = 0,ans3 = 0;
	jc[0] = 1;
	for(int i = 1;i <= 100500;i ++) 
	jc[i] = jc[i - 1] * i % md,invjc[i] = inv(jc[i]);
	invjc[0] = 1;
	for(int j = 0;j <= 20;j ++) 
	played[j][0] = 1;
	for(int i = 1;i <= 100500;i ++) 
		for(int j = 0;j <= 20;j ++) played[j][i] = jc[i + j - 1] * invjc[i - 1] % md * invjc[j] % md;
	for(int i = 1;i <= 100500;i ++) 
		for(int j = 1;j <= 20;j ++) played[j][i] = (played[j][i - 1] + played[j][i]) % md;
	for(int i = 2;i <= n;i ++){
		for(int j = 1;j * j <= i;j ++){
			if(i % j == 0){
				g[j].push_back(i),oud[i] ++; 
				if(j * j != i && j != 1)
				g[i / j].push_back(i),oud[i] ++; 
			}
		}
	}
	dp[1][0] = 1;
	ans[1][0] = 1;
	queue <int> q;
	q.push(1);
	while(!q.empty()) {
		int now = q.front();
		int sz = g[now].size();
		for(int i = 0;i < sz;i ++){
			int nxt = g[now][i];
			for(int j = 0;j <= 19;j ++){
				dp[nxt][j + 1] = (dp[nxt][j + 1] + dp[now][j]) % md;
				ans[nxt][j + 1] = (ans[now][j] * dp[now][j] % md + ans[nxt][j + 1] + dp[now][j] * nxt % md) % md;
			}
			oud[nxt] --;
			if(oud[nxt] == 0) q.push(nxt);
		} 
		q.pop();
	}
	
	for(int i = 1;i <= n;i ++){
		for(int j = 0;j <= 19;j ++){
			int lst = l1 - j - 1;
			if(lst >= 0) 
			ans2 = (ans2 + dp[i][j] * played[j + 1][lst]) % md;
		}
	}
	for(int i = 1;i <= n;i ++)
		for(int j = 0;j <= 19;j ++)
			if(l2 - j - 1 >= 0) ans3 = (ans3 + dp[i][j]) % md;
	int ans4 = 0;
	for(int i = 1;i <= n;i ++)
		for(int j = 0;j <= 19;j ++) 
			if(l2 - j - 1 >= 0) ans4 = (ans4 + ans[i][j]) % md;
	cout << ans2 << " " << ans3 << " " << ans4 << endl;
}