#include
using namespace std;
long long search(long long up, long long down, long long digit, long long mul, long long add) {
long long sum = 0;
if (add * mul >= down add * mul <= up) {
sum += 1;
}
if (add * mul > up) return 0;
for (int i = 1; i <= 9; i++) {
sum += search(up, down, digit * 10, mul * i, add + digit * i);
}
return sum;
}
long long solve(long long A, long long B) {
return search(B, A, 1, 1, 0);
}
int main() {
long long A, B;
cin >> A >> B;
cout << solve(A, B) << endl;
//system("pause");
}