Problem: The Prodiggers are quite a cool band and for this reason, they have been the surprise guest at the ENTER festival for the past 80 years. At the beginning of their careers, they weren’t so successful, so they had to spend time digging channels to earn money; hence the name. Anyway, they like to tour a lot and have surprising amounts of energy to do extremely long tours. However, they hate spending two consecutive days without having a concert, so they would like to avoid it.

A tour is defined by a sequence of concerts and days-off. You need to count in how many ways The Prodiggers can select k different tours of the same length between l and r.

For example if k = 2, l = 1 and r = 2, if we define concert day as {1} and day-off as {0}, here are all possible tours: {0}, {1}, {00}, {01}, {10}, {11}. But tour 00 can not be selected because it has 2 days-off in a row. Now, we need to count in how many ways we can select k = 2 tours of the same length in range [1;2]. Here they are: {0,1}; {01,10}; {01,11}; {10,11}.

Since their schedule is quite busy, they want you to tell them in how many ways can do that, modulo 1 000 000 007 (109 + 7).

Input

The first line of the input contains three integers k, l and r (1 ≤ k ≤ 200, 1 ≤ l ≤ r ≤ 1018).

Output

Output a single number: the number of ways to select k different tours of the same length, modulo 1 000 000 007.

Example

Input

1 1 2


Output

5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const double PI = acos(-1.);
const double eps = 1e-9;
long long modPow(long long a, long long b, long long MOD) {
  long long ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = ret * a % MOD;
    a = a * a % MOD;
  }
  return ret;
}
long long inv5 = 400000003;
long long fit(long long x) { return ((x % MOD) + MOD) % MOD; }
struct five {
  long long a, b;
  five(long long _a = 0, long long _b = 0) { a = fit(_a), b = fit(_b); }
  five operator+(five f) {
    f = f.normal();
    return five(a + f.a, b + f.b).normal();
  }
  five operator+(long long l) {
    l = fit(l);
    return five(a + l, b).normal();
  }
  five operator-(five f) {
    f = f.normal();
    return five(a - f.a, b - f.b).normal();
  }
  five operator-(long long l) {
    l = fit(l);
    return five(a - l, b).normal();
  }
  five operator*(five f) {
    f = f.normal();
    return five(a * f.a + 5 * b % MOD * f.b, a * f.b + b * f.a).normal();
  }
  five operator*(long long l) {
    l = fit(l);
    return five(a * l, b * l).normal();
  }
  bool operator==(five f) {
    f = f.normal();
    return fit(f.a - a) == 0 && fit(f.b - b) == 0;
  }
  five negate() { return five(-a, -b).normal(); }
  five pow(long long n) {
    five ret;
    ret.a = 1;
    five x = *this;
    while (n) {
      if (n & 1) ret = ret * x;
      x = x * x;
      n >>= 1;
    }
    return ret;
  }
  five normal() { return five(fit(a), fit(b)); }
  void show(string s = "") {
    cout << "(" << a << "+" << b << "[5"
         << ")" << s;
  }
  five d5() { return five(b, a * inv5).normal(); }
  five ge() { return five(a, -b).normal(); }
};
five comb[205][205];
five G(long long N, int K) {
  five p, q;
  long long inv2 = (MOD + 1) / 2;
  p.a = p.b = inv2;
  q.a = inv2, q.b = -inv2;
  q = q.normal();
  five ret;
  for (int j = (0); j < (int)(K + 1); j++) {
    five g = p.pow(j) * q.pow(K - j);
    five fh = comb[K][j];
    if ((K - j) & 1) fh = fh * -1;
    if (g == five(1, 0)) {
      ret = ret + fh * N;
    } else {
      five t = g - 1LL;
      long long temp = fit(t.a * t.a - 5 * t.b * t.b);
      temp = modPow(temp, MOD - 2, MOD);
      five now = g * (g.pow(N) - 1LL) * t.ge() * temp;
      ret = ret + now * fh;
    }
  }
  for (int j = (0); j < (int)(K); j++) ret = ret.d5();
  return ret;
}
long long t[205][205];
void solve() {
  long long k, l, r;
  cin >> k >> l >> r;
  five ret;
  for (int i = (0); i < (int)(k + 1); i++) {
    ret = (G(r + 2, i) - G(l + 1, i)) * t[k][i] + ret;
  }
  cout << ret.a << "\n";
}
int main() {
  for (int i = (0); i < (int)(201); i++) {
    comb[i][i] = comb[i][0] = 1;
    for (int j = (1); j < (int)(i); j++)
      comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
  }
  memset(t, 0, sizeof t);
  t[0][0] = 1;
  for (int i = (1); i < (int)(201); i++) {
    long long inv = modPow(i, MOD - 2, MOD);
    for (int j = (0); j < (int)(i); j++)
      t[i][j] += inv * (MOD + 1 - i) % MOD * t[i - 1][j] % MOD;
    for (int j = (0); j < (int)(i); j++) t[i][j + 1] += inv * t[i - 1][j] % MOD;
    for (int j = (0); j < (int)(i + 1); j++) t[i][j] %= MOD;
  }
  long long N, K;
  int _T = 1;
  for (int CA = (0); CA < (int)(_T); CA++) {
    solve();
  }
  return 0;
}