Problem: Lakhesh loves to make movies, so Nephren helps her run a cinema. We may call it No. 68 Cinema.

<image>

However, one day, the No. 68 Cinema runs out of changes (they don't have 50-yuan notes currently), but Nephren still wants to start their business. (Assume that yuan is a kind of currency in Regulu Ere.)

There are three types of customers: some of them bring exactly a 50-yuan note; some of them bring a 100-yuan note and Nephren needs to give a 50-yuan note back to him/her; some of them bring VIP cards so that they don't need to pay for the ticket.

Now n customers are waiting outside in queue. Nephren wants to know how many possible queues are there that they are able to run smoothly (i.e. every customer can receive his/her change), and that the number of 50-yuan notes they have after selling tickets to all these customers is between l and r, inclusive. Two queues are considered different if there exists a customer whose type is different in two queues. As the number can be large, please output the answer modulo p.

Input

One line containing four integers n (1 ≤ n ≤ 105), p (1 ≤ p ≤ 2·109), l and r (0 ≤ l ≤ r ≤ n). 

Output

One line indicating the answer modulo p.

Examples

Input

4 97 2 3


Output

13


Input

4 100 0 4


Output

35

Note

We use A, B and C to indicate customers with 50-yuan notes, customers with 100-yuan notes and customers with VIP cards respectively.

For the first sample, the different possible queues that there are 2 50-yuan notes left are AAAB, AABA, ABAA, AACC, ACAC, ACCA, CAAC, CACA and CCAA, and the different possible queues that there are 3 50-yuan notes left are AAAC, AACA, ACAA and CAAA. So there are 13 different queues satisfying the first sample. Similarly, there are 35 different queues satisfying the second sample.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int pri[55], mul[55], cnt[55];
int fac[N], inv[N];
int val[N], sum[N];
int n, mod, l, r;
void divide() {
  for (int i = (int)(2); i <= (int)(50000); i++)
    if (mod % i == 0) {
      pri[++*pri] = i;
      mul[*pri] = 1;
      for (; mod % i == 0; mod /= i) {
        mul[*pri] *= i;
        cnt[*pri]++;
      }
    }
  if (mod != 1) {
    pri[++*pri] = mod;
    mul[*pri] = mod;
    cnt[*pri] = 1;
  }
}
int power(int x, int y, int mo) {
  int s = 1;
  for (; y; y /= 2, x = 1ll * x * x % mo)
    if (y & 1) s = 1ll * s * x % mo;
  return s;
}
int C(int x, int y, int id) {
  if (x < 0 || y < 0 || y > x) return 0;
  int res = 1ll * fac[x] * inv[y] % mul[id] * inv[x - y] % mul[id];
  int T = sum[x] - sum[y] - sum[x - y];
  for (; T && res; T--, res = 1ll * res * pri[id] % mul[id])
    ;
  return res;
}
int solve(int id) {
  fac[0] = inv[0] = 1;
  int phi = mul[id] - mul[id] / pri[id];
  for (int i = (int)(1); i <= (int)(n); i++) {
    val[i] = i;
    sum[i] = 0;
    for (; val[i] % pri[id] == 0;) val[i] /= pri[id], sum[i]++;
    fac[i] = 1ll * fac[i - 1] * val[i] % mul[id];
    inv[i] = 1ll * inv[i - 1] * power(val[i], phi - 1, mul[id]) % mul[id];
    sum[i] += sum[i - 1];
  }
  int ans = 0;
  for (int i = (int)(0); i <= (int)(n); i++) {
    int nl = l, nr = min(i, r);
    nl += (nl + i) & 1;
    nr -= (nr + i) & 1;
    if (nl > nr) continue;
    int res = (C(i, (i + nl) / 2, id) + mul[id] - C(i, (i + nr) / 2 + 1, id)) %
              mul[id];
    ans = (ans + 1ll * res * C(n, i, id)) % mul[id];
  }
  return ans;
}
void exgcd(int x, int y, int &a, int &b) {
  if (!y) {
    a = 1;
    b = 0;
    return;
  }
  exgcd(y, x % y, b, a);
  b -= x / y * a;
}
int getinv(int x, int y) {
  int a, b;
  exgcd(x, y, a, b);
  return (a % y + y) % y;
}
pair<int, int> merge(pair<int, int> x, pair<int, int> y) {
  pair<int, int> ans;
  ans.first = x.first * y.first;
  ans.second =
      (1ll * getinv(x.first, y.first) * x.first % ans.first * y.second +
       1ll * getinv(y.first, x.first) * y.first % ans.first * x.second) %
      ans.first;
  return ans;
}
int main() {
  scanf("%d%d%d%d", &n, &mod, &l, &r);
  if (mod == 1) return puts("0"), 0;
  divide();
  static pair<int, int> ans[25];
  for (int i = (int)(1); i <= (int)(*pri); i++)
    ans[i] = pair<int, int>(mul[i], solve(i));
  for (int i = (int)(2); i <= (int)(*pri); i++)
    ans[i] = merge(ans[i], ans[i - 1]);
  printf("%d\n", ans[*pri].second);
}