1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PI;
typedef long long LL;
typedef double D;
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define R(I,N) for(int I=0;I<N;I++)
#define F(I,A,B) for(int I=A;I<B;I++)
#define FD(I,N) for(int I=N-1;I>=0;I--)
#define make(A) scanf("%d",&A)
#define make2(A,B) scanf("%d%d",&A,&B)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define db if(1)printf
template<typename C> void MA(C& a,C b){if(a<b)a=b;}
template<typename C> void MI(C& a,C b){if(a>b)a=b;}
LL a,b,k;
int sum(LL a){
  if(a == 0)return 0;
  return sum(a/10) + (a%10)*(a%10);
}
main(){
  scanf("%lld%lld%lld",&k,&a,&b);
  int wyn = 0;
  F(i,1,1500){
    if(b/i >= k){
      LL pom = k*i;
      if(a <= pom && pom <= b && sum(pom) == i)wyn++;
    }
  }
  printf("%d\n",wyn);
}