#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 #include<iostream> 

 #define ll long long

 using namespace std;

 typedef long long LL;

 const int MAXN=**;

 ll k,a,b;

 ll solve(ll u)

 {

     ll n,sum,ret=;

     for(ll i=;i<=MAXN;i++)

     {

         n=i*k;if(n>u) break;

         sum=;

         while(n)

         {

             sum+=(n%)*(n%);

             n/=;

         }

         if(sum==i)ret++;

     }

     return ret;

 }

 int main()

 {

     scanf("%lld%lld%lld",&k,&a,&b);

     printf("%lld\n", solve(b)-solve(a-));

 }