#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
using namespace std;
int main() {
  long long k, l, r;
  while (scanf("%lld %lld %lld", &k, &l, &r) != EOF) {
    if (r > 0 && l > 0)
      printf("%lld\n", r / k - (l - 1) / k);
    else if (r < 0 && l < 0)
      printf("%lld\n", (r + 1) / k - l / k);
    else
      printf("%lld\n", r / k - l / k + 1);
  }
  return 0;
}
