import java.io.*;
import java.util.*;

public class A {

    long mod = (long) 1e9 + 7;

    class Num {
        final long a, b;

        public Num(long a, long b) {
            this.a = a % mod;
            this.b = b % mod;
        }

        public Num add(Num other) {
            return new Num(a + other.a, b + other.b);
        }

        public Num multiply(Num other) {
            return new Num(a * other.a + 5 * b * other.b, a * other.b + b * other.a);
        }
    }

    int k;

    long[][] coeffs;

    void prepare() {
        coeffs = new long[k + 1][k + 1];
        long[][] tmpCoeffs = new long[k + 1][k + 1];
        long factK = 1;
        coeffs[0][0] = 1;

        for (int free = 0; free < k; free++) {
            factK = factK * (free + 1) % mod;

            for (int i = 0; i <= k; i++) {
                for (int j = 0; j <= k; j++) {
                    if (coeffs[i][j] != 0) {
                        tmpCoeffs[i + 1][j] += coeffs[i][j];
                        if (tmpCoeffs[i + 1][j] >= mod) {
                            tmpCoeffs[i + 1][j] -= mod;
                        }

                        tmpCoeffs[i][j + 1] += coeffs[i][j];
                        if (tmpCoeffs[i][j + 1] >= mod) {
                            tmpCoeffs[i][j + 1] -= mod;
                        }

                        long add = coeffs[i][j] * (mod - free) % mod;
                        tmpCoeffs[i][j] += add;
                        if (tmpCoeffs[i][j] >= mod) {
                            tmpCoeffs[i][j] -= mod;
                        }
                    }
                }
            }

            for (int i = 0; i <= k; i++) {
                for (int j = 0; j <= k; j++) {
                    coeffs[i][j] = tmpCoeffs[i][j];
                    tmpCoeffs[i][j] = 0;
                }
            }
        }

        factK = inv(factK);
        for (int i = 0; i <= k; i++) {
            for (int j = 0; j <= k; j++) {
                coeffs[i][j] = coeffs[i][j] * factK % mod;
            }
        }
//        System.err.println(Arrays.deepToString(coeffs));

        pow1 = new Num[k + 1];
        powA = new Num[k + 1];
        pow2 = new Num[k + 1];
        powB = new Num[k + 1];

        pow1[0] = pow2[0] = powA[0] = powB[0] = new Num(1, 0);
        for (int i = 1; i <= k; i++) {
            pow1[i] = pow1[i - 1].multiply(PHI1);
            pow2[i] = pow2[i - 1].multiply(PHI2);
            powA[i] = powA[i - 1].multiply(A);
            powB[i] = powB[i - 1].multiply(B);
        }
    }

    long inv(long x) {
        return pow(x, mod - 2);
    }

    long pow(long a, long b) {
        long res = 1;
        while (b != 0) {
            if ((b & 1) == 1) {
                res = res * a % mod;
            }
            a = a * a % mod;
            b >>>= 1;
        }
        return res;
    }

    final Num PHI1 = new Num(inv(2), inv(2));
    final Num PHI2 = new Num(inv(2), mod - inv(2));
    final Num A = new Num(0, inv(5));
    final Num B = new Num(0, mod - inv(5));

    final Num ONE = new Num(1, 0);

    Num[] pow1, pow2, powA, powB;

    long get(long n) {
        Num result = new Num(0, 0);

        for (int i = 0; i <= k; i++) {
            for (int j = 0; j <= k; j++) {
                long coef = coeffs[i][j];
                if (coef == 0) {
                    continue;
                }

                Num cur = new Num(coef, 0).multiply(powA[i]).multiply(powB[j]);

                Num x = pow1[i].multiply(pow2[j]);
                x = geomSum(x, n + 1);

                result = result.add(cur.multiply(x));
            }
        }
        return result.a;
    }

    Num geomSum(Num x, long n) {
        if (n == 0) {
            return new Num(0, 0);
        }
        if (n % 2 == 0) {
            Num x2 = x.multiply(x);
            Num result = geomSum(x2, n / 2);
            return (ONE.add(x)).multiply(result);
        } else {
            return ONE.add(x.multiply(geomSum(x, n - 1)));
        }
    }

    public void solve() {
        k = in.nextInt();
        prepare();
        long l = in.nextLong(), r = in.nextLong();
//        for (int i = 0; i < 20; i++) {
//            Num fib = A.multiply(pow1[i]).add(B.multiply(pow2[i]));
//            System.err.println(fib.a + " " + fib.b);
//            System.err.println(get(i + 1) - get(i));
//        }
        out.println((get(r + 2) - get(l + 1) + mod) % mod);
    }

    public void run() {
        in = new FastScanner();
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }

    FastScanner in;
    PrintWriter out;

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(String fileName) {
            try {
                br = new BufferedReader(new FileReader(fileName));
            } catch (FileNotFoundException e) {
            }
        }

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String nextToken() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(nextToken());
        }

        long nextLong() {
            return Long.parseLong(nextToken());
        }

        double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }

    public static void main(String[] args) {
        new A().run();
    }
}

//package bubblecup9f;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class A5 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";

	final int mod = 1000000007;

	public static int[][] enumFIF(int n, int mod) {
		int[] f = new int[n + 1];
		int[] invf = new int[n + 1];
		f[0] = 1;
		for (int i = 1; i <= n; i++) {
			f[i] = (int) ((long) f[i - 1] * i % mod);
		}
		long a = f[n];
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		invf[n] = (int) (p < 0 ? p + mod : p);
		for (int i = n - 1; i >= 0; i--) {
			invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);
		}
		return new int[][] { f, invf };
	}

	void solve()
	{
		int K = ni();
		long L = nl(), R = nl();

		int[][] fif = enumFIF(K+2, mod);

		long[][] fs = new long[K+1][K+1];
		fs[0][0] = fif[1][K];
		for(int i = 0;i < K;i++){
			for(int j = 0;j <= i;j++){
				fs[i+1][j+1] += fs[i][j];
				if(fs[i+1][j+1] >= mod)fs[i+1][j+1] -= mod;
				fs[i+1][j] += fs[i][j] * (mod-i);
				fs[i+1][j] %= mod;
			}
		}

		long ret = count(R+1, fs[K], fif) - count(L, fs[K], fif);
		if(ret < 0)ret += mod;
		out.println(ret);
	}

	long count(long n, long[] fs, int[][] fif)
	{
		long ret = 0;
		for(int i = 0;i < fs.length;i++){
			ret += fpowsum(i, n, mod, fif) * fs[i];
			ret %= mod;
		}
		return ret;
	}

	long fpowsum(int K, long n, int mod, int[][] fif)
	{
		Exmod plus = Exmod.div(new Exmod(1,1),2);
		Exmod[] pluss = new Exmod[K+1];
		pluss[0] = new Exmod(1);
		for(int i = 1;i <= K;i++)pluss[i] = Exmod.mul(pluss[i-1], plus);

		Exmod minus = Exmod.div(new Exmod(1,-1),2);
		Exmod[] minuss = new Exmod[K+1];
		minuss[0] = new Exmod(1);
		for(int i = 1;i <= K;i++)minuss[i] = Exmod.mul(minuss[i-1], minus);

		Exmod ret = new Exmod(0);
		for(int i = K, sig = 1;i >= 0;i--, sig = -sig){
			Exmod ratio = Exmod.mul(pluss[i], minuss[K-i]);
			ret.add(Exmod.mul(Exmod.sumgp(ratio, n+2), C(K, i, mod, fif) * sig));
		}

		Exmod fifth = Exmod.pow(Exmod.inv(new Exmod(0, 1)), K);
		ret.mul(fifth);

		assert ret.b == 0;
		return ret.a;
	}

	public static long C(int n, int r, int mod, int[][] fif) {
		if (n < 0 || r < 0 || r > n)
			return 0;
		return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;
	}

	public static class Exmod {
		public long a, b;
		public static final long E = 5;
		public static final int mod = 1000000007;

		@Override
		public String toString() {
			if(a == 0 && b == 0)return "0";
			StringBuilder ret = new StringBuilder();
			if(a != 0){
				ret.append(a);
				if(b > 0)ret.append("+");
			}
			if(b != 0)ret.append(b + "√" + E);
			return ret.toString();
		}

		public Exmod(long a) {
			this.a = a;
			this.b = 0;
			normalize();
		}

		public Exmod(long a, long b) {
			this.a = a;
			this.b = b;
			normalize();
		}

		public Exmod(Exmod e) {
			this.a = e.a;
			this.b = e.b;
			normalize();
		}

		public void normalize(){
			if(a >= mod || a < 0){
				a %= mod;
				if(a < 0)a += mod;
			}
			if(b >= mod || b < 0){
				b %= mod;
				if(b < 0)b += mod;
			}
		}

		public Exmod add(Exmod t){ a += t.a; b += t.b; normalize(); return this; }
		public Exmod sub(Exmod t){ a -= t.a; b -= t.b; normalize(); return this; }
		public Exmod mul(Exmod t){
			long na = a * t.a + b * t.b * E;
			long nb = a * t.b + b * t.a;
			a = na; b = nb; normalize(); return this;
		}
		public Exmod div(Exmod t){
			long den = t.a*t.a-E*t.b*t.b;
			den %= mod; if(den < 0)den += mod;
			long iden = invl(den, mod);
			long numr = (a*t.a - b*t.b*E) % mod * iden % mod;
			long numi = (b*t.a - a*t.b) % mod * iden % mod;
			a = numr; b = numi; normalize(); return this;
		}
		public Exmod negate(){ a = -a; b = -b; normalize(); return this; }

		public static Exmod negate(Exmod a){ return new Exmod(-a.a, -a.b);}
		public static Exmod add(Exmod a, Exmod b){return new Exmod(a.a + b.a, a.b + b.b);}
		public static Exmod sub(Exmod a, Exmod b){return new Exmod(a.a - b.a, a.b - b.b);}
		public static Exmod mul(Exmod a, Exmod b){return new Exmod(a.a * b.a + a.b * b.b * E, a.a * b.b + a.b * b.a);}
		public static Exmod div(Exmod a, Exmod b){
			long den = b.a*b.a-E*b.b*b.b;
			den %= mod; if(den < 0)den += mod;
			long iden = invl(den, mod);
			long numr = (a.a*b.a - a.b*b.b*E) % mod * iden % mod;
			if(numr < 0)numr += mod;
			long numi = (a.b*b.a - a.a*b.b) % mod * iden % mod;
			if(numi < 0)numi += mod;
			return new Exmod(numr, numi);
		}

		public static Exmod inv(Exmod a){
			long den = a.a*a.a-E*a.b*a.b;
			den %= mod; if(den < 0)den += mod;
			long iden = invl(den, mod);
			long numr = a.a * iden % mod;
			long numi = -a.b * iden % mod;
			if(numi < 0)numi += mod;
			return new Exmod(numr, numi);
		}

		// a+bx (a+bx)(c-dx) (ac-bdE)+x(bc-ad)
		// ----=------------=-----------------
		// c+dx (c+dx)(c-dx)    c^2-Ed^2

		public static Exmod mul(Exmod a, long b){return new Exmod(a.a * b, a.b * b);}
		public static Exmod div(Exmod a, long b){return mul(a, invl(b, mod));}

		public static Exmod pow(Exmod a, long n) {
			Exmod ret = new Exmod(1);
			int x = 63 - Long.numberOfLeadingZeros(n);
			for (; x >= 0; x--) {
				ret = mul(ret, ret);
				if(n<<~x<0)ret = mul(ret, a);
			}
			return ret;
		}

		public static Exmod sumgp(Exmod a, long n)
		{
			Exmod mul = new Exmod(1);
			Exmod ret = new Exmod(0);
			for(int i = 63-Long.numberOfLeadingZeros(n);i >= 0;i--){
				mul.a += 1;
				ret = mul(ret, mul);
				mul.a -= 1;
				mul = mul(mul, mul);
				if(n<<~i<0){
					ret = mul(ret, a);
					ret.a++; ret.normalize();
					mul = mul(mul, a);
				}
			}
			return ret;
		}

		public static long invl(long a, long mod) {
			long b = mod;
			long p = 1, q = 0;
			while (b > 0) {
				long c = a / b;
				long d;
				d = a;
				a = b;
				b = d % b;
				d = p;
				p = q;
				q = d - c * q;
			}
			return p < 0 ? p + mod : p;
		}
	}

	void run() throws Exception
	{
		is = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		long s = System.currentTimeMillis();
		solve();
		out.flush();
		tr(System.currentTimeMillis()-s+"ms");
	}

	public static void main(String[] args) throws Exception { new A5().run(); }

	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;

	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}

	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }

	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}

	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}

	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}

	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private boolean oj = System.getProperty("ONLINE_JUDGE") != null;
	private void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }
}

import java.util.Scanner;

public class File1 {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int MOD = 1000000007;
		int k = in.nextInt();
		long l = in.nextLong();
		long r = in.nextLong();
		long m = r-l+1;
		int n = (int)m;
		long pow[] = new long[n+1];
		pow[0] = 1;
		for(int i=1;i<=n;i++){
			pow[i] = 2*pow[i-1];
			pow[i]%=MOD;
		}
		long numPoss[] = new long[n];
		numPoss[0] = 2;
		numPoss[1] = 3;
		for(int i=2;i<n;i++){
			numPoss[i] = pow[(i+1)/2]+pow[i-(i+1)/2]-1;
			numPoss[i]%=MOD;
		}
		long ans = 0;
		for(int i=0;i<n;i++){
			if(k>numPoss[i])
				continue;
			if(k==numPoss[i]){
				ans+=1;
				ans%=MOD;
				continue;
			}
			long temp = 1;
			for(int j=0;j<k;j++){
				temp*=(numPoss[i]-j);
				temp%=MOD;
			}
			ans+=temp;
			ans%=MOD;
		}
		System.out.println(ans);
	}
}

import java.util.Scanner;

public class File1 {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int MOD = 1000000007;
		int k = in.nextInt();
		long l = in.nextLong();
		long r = in.nextLong();
		long m = r-l+1;
		int n = (int)m;
		long pow[][] = new long[n+1][2];
		pow[1][0] = 1;
		pow[1][1] = 1;
		for(int i=2;i<=n;i++){
			pow[i][1] = pow[i-1][0]+pow[i-1][1];
			pow[i][1]%=MOD;
			pow[i][0] = pow[i-1][1];
		}
		long ans = 0;
		for(int i=1;i<=n;i++){
			if(k>pow[i][0]+pow[i][1])
				continue;
			if(k==pow[i][0]+pow[i][1]){
				ans+=1;
				ans%=MOD;
				continue;
			}
			long temp = 1;
			long numPoss = pow[i][0]+pow[i][1];
			for(int j=0;j<k;j++){
				temp*=(numPoss-j);
				temp%=MOD;
			}
			ans+=temp;
			ans%=MOD;
		}
		System.out.println(ans);
	}
}