import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10L^^9 + 7;
enum LIM = 3 * 10^^5;

long[] inv, fac, invFac;
void prepare() {
  inv = new long[LIM];
  fac = new long[LIM];
  invFac = new long[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = MO - ((MO / i) * inv[cast(size_t)(MO % i)]) % MO;
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = (fac[i - 1] * i) % MO;
    invFac[i] = (invFac[i - 1] * inv[i]) % MO;
  }
}
long binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] % MO * invFac[cast(size_t)(n - k)] % MO;
  } else {
    return 0;
  }
}

void main() {
  /*
  debug {
    foreach (n; 1 .. 7) {
      int[int] cnt;
      int[] b = iota(n).array;
      do {
        int[] a = b.dup;
        foreach (i; 0 .. n - 1) {
          if (a[i] > a[i + 1]) {
            swap(a[i], a[i + 1]);
          }
        }
        int key;
        foreach (i; 0 .. n) {
          key += n^^i * a[i];
        }
        ++cnt[key];
      } while (b.nextPermutation);
      foreach (key; cnt.keys.sort) {
        writeln(iota(n).map!(i => key / n^^i % n), " ", cnt[key]);
      }
    }
  }
  */
  
  prepare();
  
  try {
    for (; ; ) {
      const N = readInt();
      const L = readLong();
      const R = readLong();
      
      const logR = bsr(max(R, 1));
      auto dp = new long[][](logR + 1, N + 1);
      dp[0][1] = 1;
      foreach (k; 1 .. logR + 1) {
        // dp[k][n] = Sum[1 <= i <= n - 1] ((n - 2)! / (i - 1)!) dp[k - 1][i]
        long sum = dp[k - 1][1];
        foreach (n; 2 .. N + 1) {
          dp[k][n] = (fac[n - 2] * sum) % MO;
          sum += invFac[n - 1] * dp[k - 1][n];
          sum %= MO;
        }
      }
      debug {
        if (N <= 10) {
          foreach (k; 0 .. logR + 1) {
            writeln(dp[k]);
          }
        }
      }
      long ans;
      if (L <= 0 && 0 <= R) {
        ans += (N - 1) * fac[N - 1];
        ans %= MO;
      }
      foreach (k; 0 .. logR + 1) {
        if (L <= (1L << k) && (1L << k) <= R) {
          ans += dp[k][N];
          ans %= MO;
        }
      }
      ans = (ans % MO + MO) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}