#include<bits/stdc++.h>
using namespace std;
namespace io{
	char buf[1<<20],*p1=buf,*p2=buf;
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin)),p1==p2?EOF:*p1++)
	int read(){
		int x=0,f=0;char c=gc();
		while(c< '0'||c> '9') f|=c=='-',c=gc();
		while(c>='0'&&c<='9') x=x*10+(c^48),c=gc();
		return f?-x:x;
	}
	char pbuf[1<<20],*pp=pbuf;
#define flush() (fwrite(pbuf,1,pp-pbuf,stdout),pp=pbuf)
#define pc(ch) (pp==pbuf+(1<<20)&&flush(),*pp++=(ch))
	class Flush{public:~Flush(){flush();}}_;
	void write(int x,char ch=0){
		if(x<0) pc('-'),x=-x;
		static int st[35];int top=0;
		do st[top++]=x%10,x/=10;while(x);
		while(top) pc(st[--top]^48);if(ch) pc(ch);
	}
	void putc(char ch){pc(ch);}
}
#define ll long long
#define N 100009
const int mo=1000000007;
int fac[N],invf[N];
int n,l1,l2;
int ans2,ans3,ans4;
int CC[21][N];
int C(int n,int m){
	if(n<0||m<0||n<m) return 0;
	return (ll)fac[n]*invf[m]%mo*invf[n-m]%mo;
}
void dfs(int x,int d,int s){
	s+=x;
	if(d<l2) ans3++,ans4=(ans4+s)%mo;
	if(d<l1) ans2=(ans2+CC[d][l1-1])%mo;
	for(int y=x*2;;y+=x)
		if(y<=n) dfs(y,d+1,s);
		else break;
}
int main(){
	fac[0]=1;
	invf[100000]=716327852;
	for(int i=1;i<=100000;i++) fac[i]=(ll)fac[i-1]*i%mo;
	for(int i=99999;i>=0;i--) invf[i]=(ll)invf[i+1]*(i+1)%mo;
	for(int i=0;i<=100000;i++)
		for(int j=0;j<=18;j++)
			CC[j][i]=(CC[j][i-1]+C(i,j))%mo;
//	freopen("in.in","r",stdin);
	int k;
	n=io::read();
	k=io::read();
	l1=io::read();
	l2=io::read();
	if(k==0) io::write(n,' ');
	else{
		int ans1=0;
		for(int i=1;i<=k;i++)
			if(k%i==0) ans1++;
		io::write(ans1,' ');
	}
	dfs(1,0,0);
	io::write(ans2,' ');
	io::write(ans3,' ');
	io::write(ans4);
	return 0;
}