hdu 2151

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=110;
int dp[N][N];

int main()
{
	// freopen("in","r",stdin);
	// freopen("out","w",stdout);
	int n,m,t,p,i,r;
   	
   	while( scanf("%d%d%d%d",&n,&p,&m,&t)!=EOF )
   	{
   		memset(dp,0,sizeof(dp));
   		dp[0][p]=1;
   		for(i=1;i<=m;i++)
   			for(r=1;r<=n;r++) dp[i][r]=dp[i-1][r-1]+dp[i-1][r+1];
   		printf("%d\n", dp[m][t]);
   	}
	return 0;
}