#include <bits/stdc++.h>

#include <atcoder/modint>

#include <algorithm>
#include <cassert>
#include <vector>

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}

template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

template <typename T>
struct CoordComp {
    std::vector<T> v;
    bool sorted;

    CoordComp() : sorted(false) {}

    int size() { return v.size(); }

    void add(T x) { v.push_back(x); }

    void build() {
        std::sort(v.begin(), v.end());

        v.erase(std::unique(v.begin(), v.end()), v.end());
        sorted = true;
    }

    int get_idx(T x) {
        assert(sorted);
        return lower_bound(v.begin(), v.end(), x) - v.begin();
    }

    T &operator[](int i) { return v[i]; }
};


#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For(i, 0, n)
#define rrep(i, n) rFor(i, n, 0)
#define fi first
#define se second

using namespace std;

using lint = long long;
using pii = pair<int, int>;
using pll = pair<lint, lint>;

using namespace atcoder;
using mint = modint1000000007;

struct Trie {
    vector<map<char, int>> nxt = {{}};
    vector<int> fail = {-1};
    int sz = 1;
    vector<bool> ac = {false};

    Trie() {}

    Trie(vector<string> &vs) {
        for (auto &p : vs) add(p);
        aho_corasick();
    }

    void create_node() {
        ++sz;
        nxt.resize(sz);
        fail.resize(sz);
        ac.resize(sz, false);
    }

    void add(string &p) {
        int cur = 0;
        for (auto c : p) {
            if (nxt[cur].find(c) != nxt[cur].end())
                cur = nxt[cur][c];
            else {
                create_node();
                nxt[cur][c] = sz - 1;
                cur = sz - 1;
            }
        }
        ac[cur] = true;
    }

    void aho_corasick() {
        queue<int> que;
        que.push(0);
        while (!que.empty()) {
            auto v = que.front();
            que.pop();
            for (auto [c, u] : nxt[v]) {
                int p = fail[v];
                while (p >= 0 && nxt[p].find(c) == nxt[p].end()) p = fail[p];
                fail[u] = (p >= 0 ? nxt[p][c] : 0);
                if (ac[fail[u]]) ac[u] = true;
                que.push(u);
            }
        }
    }

    vector<int> match(string &t) {
        vector<int> ret;
        int cur = 0;
        for (auto c : t) {
            while (cur >= 0 && nxt[cur].find(c) == nxt[cur].end())
                cur = fail[cur];
            cur = (cur >= 0 ? nxt[cur][c] : 0);
            ret.push_back(cur);
        }
        return ret;
    }
};

int main() {
    int n;
    lint L, R;
    scanf("%d%lld%lld", &n, &L, &R);

    Trie tr;
    for (lint a = 0, b = 1; b <= R;) {
        auto s = to_string(b);
        if (L <= b) tr.add(s);
        auto c = a;
        a = b;
        b += c;
    }
    tr.aho_corasick();

    vector<mint> dp(tr.sz, 0);
    dp[0] = 1;
    rep(i, n) {
        vector<mint> nxt(tr.sz, 0);

        rep(j, tr.sz) if (!tr.ac[j]) for (char c = '0'; c <= '9'; ++c) {
            int cur = j;
            while (cur >= 0 && tr.nxt[cur].find(c) == tr.nxt[cur].end()) {
                cur = tr.fail[cur];
            }
            cur = (cur >= 0 ? tr.nxt[cur][c] : 0);
            nxt[cur] += dp[j];
        }

        swap(dp, nxt);
    }
    mint ans = 0;
    rep(j, tr.sz) if (!tr.ac[j]) ans += dp[j];
    ans -= 1;
    printf("%u\n", ans.val());
}