#include <bits/stdc++.h>
using namespace std;
inline char read() {
  static const int IN_LEN = 1000000;
  static char buf[IN_LEN], *s, *t;
  return (s == t               ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin),
          (s == t ? -1 : *s++) : *s++);
}
template <class T>
inline void read(T &x) {
  static bool iosig;
  static char c;
  for (iosig = false, c = read(); !isdigit(c); c = read()) {
    if (c == '-') iosig = true;
    if (c == -1) return;
  }
  for (x = 0; isdigit(c); c = read()) x = ((x + (x << 2)) << 1) + (c ^ '0');
  if (iosig) x = -x;
}
const int OUT_LEN = 10000000;
char obuf[OUT_LEN], *ooh = obuf;
inline void print(char c) {
  if (ooh == obuf + OUT_LEN) fwrite(obuf, 1, OUT_LEN, stdout), ooh = obuf;
  *ooh++ = c;
}
template <class T>
inline void print(T x) {
  static int buf[30], cnt;
  if (x == 0)
    print('0');
  else {
    if (x < 0) print('-'), x = -x;
    for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 + 48;
    while (cnt) print((char)buf[cnt--]);
  }
}
inline void flush() { fwrite(obuf, 1, ooh - obuf, stdout); }
long long n, l, r, a[233];
long long calc(long long x) {
  if (x < 2) return 1;
  return 1 + 2 * calc(x >> 1);
}
int solve(int s, long long l, long long r) {
  if ((n >> s) > 1) {
    int ans = 0;
    if (l <= a[s + 1]) ans += solve(s + 1, l, min(a[s + 1], r));
    if (l <= a[s + 1] + 1 && a[s + 1] + 1 <= r) ans += (n >> s) & 1;
    if (r > a[s + 1] + 1)
      ans += solve(s + 1, max(1ll, l - a[s + 1] - 1), r - a[s + 1] - 1);
    return ans;
  } else
    return n >> s;
}
int main() {
  read(n), read(l), read(r);
  for (register int i = (0); i <= (50); ++i)
    if (n >> i)
      a[i] = calc(n >> i);
    else
      break;
  printf("%d", solve(0, l, r));
  return 0;
}
