/*	
 *  eat_code    
 */
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#define mp make_pair
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int)x.size()
#define endl '\n'
#define nl cout << endl
#define LSOne(S) (S & (-S))
#define F first
#define S second
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) for (ll i=n-1;i>=a;i--)
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
ll INF = 1e12;
ll M = 1E9 + 7;
int MAXN = 123456;
double PI = 2 * acos(0);
#define what_is(x) cout << #x << " = " << x << endl
#define boost ios::sync_with_stdio(false);cin.tie(NULL)
ll n, lt, rt;
int LOG2(long long int n){
  int c=0;
  while(n>1){
    c++; n>>=1;
  }
  return c;
}
ll f(ll val, ll l, ll r){
	ll ans = 0;
	if((r >= lt) && (l <= rt)){
		if(l == r)return val;
		ans += (f(val / 2 , l , (l + r )/ 2 - 1) 
		        + f(val % 2, (l + r)/ 2, (l + r)/ 2)
		        + f(val / 2, (l + r)/ 2 + 1, r) );
	}
	return ans;
}
int main() {
	//boost;
	if (fopen("input.txt", "r")) {
		freopen("input.txt", "r", stdin);
		freopen("output.txt", "w", stdout);
	}
	cin >> n >> lt >> rt;
	ll total = 2LL * ( 1LL << (ll) floor(LOG2(n)) ) - 1;
	ll cnt = f(n, 1, total);
	cout << cnt << "\n";
	return 0;
}
//  Train Insane or Remain the same