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
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
#include <bits/stdc++.h>
using namespace std;
//{
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define all(v) (v).begin(),(v).end()
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define PII pair<int,int>
#define st first
#define nd second
#define pb push_back
#define lint long long int
#define VI vector<int>

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
};
//{
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} 
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue

#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);}
#define jeb() fflush(stdout);
//}

int mod = 2520;
VI divs;
int idivs[2600];
int p10[20];
lint memo[20][50][2530][2];

int gcd(int a, int b) {
	return a == 0 ? b : gcd(b%a, a);
}

int lcm(int a, int b) {
	if (a*b == 0) return a + b;
	return (a*b)/gcd(a,b);
}

VI digs;

lint doit(int digit, int nww, int rest, int prefix) {
	int unpacked = divs[nww];
	// debug() << imie(digit) imie(nww) imie(rest) imie(prefix) imie(unpacked);

	if (digit == -1) {
		if (unpacked!=0 && rest % unpacked == 0) return 1;
		return 0;
	}
	if (memo[digit][nww][rest][prefix] != -1) return memo[digit][nww][rest][prefix];
	lint ans = 0;
	if (nww == 0) ans += doit(digit-1,0,0,0);
	FOR(i,1,10) {
		if (prefix == 1 && i > digs[digit]) break;
		ans += doit(digit-1, idivs[lcm(unpacked, i)], (rest + p10[digit]*i)%mod, (prefix == 1 && i == digs[digit]) ? 1 : 0);
	}
	memo[digit][nww][rest][prefix] = ans;
	return ans;
}

lint rob(lint n) {
	if (n == 0) {
		return 0;
	}
	FOR(i,0,20) FOR(j,0,50) FOR(k,0,2530) FOR(l,0,2) memo[i][j][k][l]=-1;
	digs.clear();
	while (n > 0) {
		digs.pb(n%10);
		n = n / 10;
	}
	// debug() << digs;
	return doit(digs.size()-1,0,0,1);
}


int main() {
	divs.pb(0); idivs[0] = 0;
	FOR(i,1,mod+1) if (mod % i == 0) {
		idivs[i] = divs.size(); 
		divs.pb(i);
	}
	p10[0] = 1;
	FOR(i,1,20) p10[i] = (p10[i-1] * 10) % mod;

	lint x, y;
	scanf("%lld %lld", &x, &y);
	printf("%lld\n", rob(y) - rob(x-1));
	
}