import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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)); }


struct ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 10^^9 + 7;
alias Mint = ModInt!MO;


enum E = 10;
int V;
int[][] next;
int[] fail, ac;

int newNode() {
  next ~= new int[E];
  next[$ - 1][] = -1;
  fail ~= -1;
  ac ~= 0;
  return V++;
}
void bfs() {
  DList!int que;
  que ~= 0;
  for (; !que.empty; ) {
    const u = que.front;
    que.removeFront;
    foreach (e; 0 .. E) {
      const v = next[u][e];
      if (v != -1) {
        fail[v] = (u == 0) ? 0 : next[fail[u]][e];
        ac[v] |= ac[fail[v]];
        que ~= v;
      } else {
        next[u][e] = (u == 0) ? 0 : next[fail[u]][e];
      }
    }
  }
}


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto L = readLong();
      auto R = readLong();
      
      long[] fibs;
      for (long a = 1, b = 1; b <= R; ) {
        if (L <= b && b <= R) {
          fibs ~= b;
        }
        a += b;
        swap(a, b);
      }
      debug {
        writeln("fibs = ", fibs);
      }
      
      V = 0;
      next = [];
      fail = [];
      ac = [];
      newNode;
      foreach (b; fibs) {
        int u = 0;
        foreach (c; b.to!string) {
          const e = c - '0';
          if (next[u][e] == -1) {
            next[u][e] = newNode;
          }
          u = next[u][e];
        }
        ac[u] = true;
      }
      bfs;
      debug {
        writeln("V = ", V);
      }
      
      auto dp = new Mint[][](N + 1, V);
      dp[0][0] = 1;
      foreach (i; 0 .. N) {
        foreach (u; 0 .. V) {
          if (!ac[u]) {
            foreach (e; 0 .. E) {
              dp[i + 1][next[u][e]] += dp[i][u];
            }
          }
        }
      }
      Mint ans;
      foreach (u; 0 .. V) {
        if (!ac[u]) {
          ans += dp[N][u];
        }
      }
      ans -= 1;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}