#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 1000100;

ll n, L, R, P, fac[maxn], ifac[maxn], N, G, q, r, inv[maxn], pw[maxn];

inline ll qpow(ll b, ll p) {
	ll res = 1;
	while (p) {
		if (p & 1) {
			res = res * b % P;
		}
		b = b * b % P;
		p >>= 1;
	}
	return res;
}

inline ll C(ll n, ll m) {
	if (n < m || n < 0 || m < 0) {
		return 0;
	}
	if (n >= P) {
		return C(n / P, m / P) * C(n % P, m % P) % P;
	} else {
		return fac[n] * ifac[m] % P * ifac[n - m] % P;
	}
}

inline bool check(ll x) {
	ll t = P - 1;
	vector<ll> vc;
	for (ll i = 2; i * i <= t; ++i) {
		if (t % i == 0) {
			vc.pb(i);
			while (t % i == 0) {
				t /= i;
			}
		}
	}
	if (t > 1) {
		vc.pb(t);
	}
	for (ll y : vc) {
		if (qpow(x, (P - 1) / y) == 1) {
			return 0;
		}
	}
	return 1;
}

inline ll g(ll n, ll m) {
	ll p = 1, ip = 1, iG = qpow(G, P - 2), res = 0;
	for (int i = 0; i <= P - 2; ++i, p = p * G % P, ip = ip * iG % P) {
		if (p + n - 1 >= P) {
			continue;
		}
		if (ip == 1) {
			res = (res + (m + 1) * fac[p + n - 1] % P * ifac[p - 1]) % P;
		} else {
			res = (res + (pw[((-(m + 1) * i) % (P - 1) + P - 1) % (P - 1)] + P - 1) % P * inv[(ip + P - 1) % P] % P * fac[p + n - 1] % P * ifac[p - 1]) % P;
		}
	}
	return (P - res) % P;
}

inline ll h(ll m) {
	if (m < q) {
		return 0;
	}
	ll k = (m - q) / (P - 1);
	ll t = (m - q) % (P - 1);
	ll ans = C(q, k) * g(r, t) % P;
	ans = (ans - C(q - 1, k - 1) * fac[r] % P + P) % P;
	if ((q - k) & 1) {
		ans = (P - ans) % P;
	}
	return ans;
}

void solve() {
	scanf("%lld%lld%lld%lld", &n, &L, &R, &P);
	N = P - 1;
	fac[0] = 1;
	for (int i = 1; i <= N; ++i) {
		fac[i] = fac[i - 1] * i % P;
	}
	ifac[N] = qpow(fac[N], P - 2);
	for (int i = N - 1; ~i; --i) {
		ifac[i] = ifac[i + 1] * (i + 1) % P;
	}
	inv[1] = 1;
	for (int i = 2; i <= N; ++i) {
		inv[i] = (P - P / i) * inv[P % i] % P;
	}
	for (G = 1;; ++G) {
		if (check(G)) {
			break;
		}
	}
	pw[0] = 1;
	for (int i = 1; i <= P - 2; ++i) {
		pw[i] = pw[i - 1] * G % P;
	}
	q = n / P;
	r = n - P * q;
	printf("%lld\n", (h(R) - h(L - 1) + P) % P);
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}