#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<28;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

ll n,l,r;

int main(){
	cin>>n>>l>>r;
	assert(2<=n&&n<=100000);
	assert(0<=l&&l<=r&&r<=1000000000000000000);
	vl a(n);
	for(int i=0;i<n;i++) a[i]=i+1;
	ll res=0;
	do{
		ll x=1,m=0;
		for(int i=0;i<n-1;i++){
			if(m<a[i]) x*=2;
			m=max(m,a[i]);
		}
		if(a[n-1]!=n) x=0;
		if(l<=x&&x<=r) res++;
	}while(next_permutation(a.begin(),a.end()));
	cout<<res<<endl;
}