#include <iostream>
#include <algorithm>
#include <cstdio>

using namespace std;

int f(long long n) {
	int res = 0;
	while (n) {
		int x = n % 10;
		res += x*x;
		n /= 10;
	}

	return res;
}

long long g(long long a, long long b, long long k) {
	long long res = 0;

	if (a % k != 0)
		a += k - a % k;

	while (a <= b) {
		if (f(a)*k == a) ++res;
		if (a / k > 9 * 9 * 18) break;
		a += k;
	}
	return res;
}

int main(int argc, char* argv[]) {
	long long k, a, b;

	cin >> k >> a >> b;

	cout << g(a, b, k) << endl;

	return 0;
}