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
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   Vi         = vector<int>;
using   Pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

constexpr int MOD = 2520;

ll dp[2][MOD][1<<9];

ll solve(ll n) {
	string lim = to_string(n);
	memset(dp[1], 0, sizeof(dp[1]));

	int seenMask = 0;
	int seenRem = 0;
	bool seenZero = 0;

	rep(i, 0, sz(lim)) {
		memset(dp[i&1], 0, sizeof(dp[0]));
		dp[i&1][0][0]++;

		if (!seenZero) {
			rep(d, 1, lim[i]-'0') {
				int nextMask = seenMask | (1 << (d-1));
				int nextRem = (seenRem + d) % MOD;
				dp[i&1][nextRem][nextMask]++;
			}
		}

		rep(rem, 0, MOD) {
			int r = rem*10 % MOD;
			rep(mask, 0, 1<<9) {
				rep(d, 1, 10) {
					int nextMask = mask | (1 << (d-1));
					int nextRem = r + d;
					if (r >= MOD) r -= MOD;
					dp[i&1][nextRem][nextMask] += dp[(i&1)^1][rem][mask];
				}
			}
		}

		int d = lim[i]-'0';
		if (d != 0) {
			seenMask |= (1 << (d-1));
			seenRem = (seenRem+d)*10 % MOD;
		} else {
			seenZero = 1;
		}
	}

	auto& res = dp[(sz(lim)-1) & 1];
	ll ans = 0;

	rep(rem, 0, MOD) {
		rep(mask, 0, 1<<9) {
			bool ok = 1;
			for (int tmp = mask; tmp; tmp &= tmp-1) {
				int d = __builtin_ctz(tmp) + 1;
				if (rem % d != 0) {
					ok = 0;
					break;
				}
			}
			if (ok) {
				ans += res[rem][mask];
			}
		}
	}

	return ans;
}

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(10);
	ll l, r; cin >> l >> r;
	cout << solve(r+1) - solve(l) << '\n';
	return 0;
}