// Skyqwq
#include <iostream>
#include <cstdio>

using namespace std;

typedef long long LL;

const int S = 50;

int n, P, k, r;

struct Mat{
	int n, m, w[S][S];
	Mat inline operator * (const Mat &b) const {
		Mat c; c.n = n, c.m = b.m;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < b.m; j++) {
				c.w[i][j] = 0;
				for (int k = 0; k < m; k++) {
					c.w[i][j] = (c.w[i][j] + (LL)w[i][k] * b.w[k][j]) % P;
				}
			}
		}
		return c;
	}
} res, A;

int main() {
	scanf("%d%d%d%d", &n, &P, &k, &r);
	res.n = 1, res.m = A.n = A.m = k;
	res.w[0][0] = 1;
	for (int i = 0; i < k; i++) {
		A.w[i][i] ++;
		A.w[i][(i + 1) % k] ++;
	}
	LL b = (LL)n * k;
	while (b) {
		if (b & 1) res = res * A;
		A = A * A;
		b >>= 1;
	}
	printf("%d\n", res.w[0][r]);
	return 0;
}