///makra zaczerpniete z "Algorytmiki Praktycznej" Piotra Stanczyka
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
//#include <complex>
//#include <iterator>
#include <set>
//#include <bitset>
#include <map>
//#include <stack>
#include <list>
//#include <queue>
//#include <deque>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i !=(c).end(); ++i)
#define FORE(i, c) for(VAR(i, (c).begin()), KS=(c).end(); i !=KS; ++i)
#define PB push_back
#define ST first
#define ND second
const int INF = 1000000000;
const double EPS = 10e-9;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
#define PF push_front
#define MP make_pair
struct tri
{
int a,b,c;
tri(int k=0,int l=0,int m=0)
{
a=k;
b=l;
c=m;
}
};
LL kwa(LL k)
{
LL w=0;
while(k)
{
w+=(k%10)*(k%10);
k/=10;
}
return w;
}
int main()
{
LL k,a,b,i;
int w=0;
scanf("%lld%lld%lld",&k,&a,&b);
for(i=1;i<=1458;++i)
{
if(i*k>=a && kwa(k*i)*k==k*i)
{
++w;
// printf("%I64d\n",k*i);
}
if(i*k>b)
break;
}
printf("%d",w);
return 0;
}