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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
#include <bits/stdc++.h>
using namespace std;
#define mk make_pair
#define fi first
#define sz(x) x.size()
#define se second
#define pb push_back
#define VAR(v) #v << " = " << v << " "
#define debug if(0)
#define M_PI 3.14159265358979323846
typedef complex<long double> C;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ll> Matrix;
const int maxn = (int)1e6 + 9;
const int INF = (int)1e9 + 7;
const int mod = (int)2520;
const int mask = (1<<9);
ll dp[20][mask][mod];
ll tens[19];

int length(ll x){
    int cnt = 0;
    while(x)
        x/=10, cnt++;
    return cnt;
}

ll reverse(ll x){
    ll ret = 0;
    int j = length(x) - 1;
    for(int i = 0; x; i++, j--, x/=10)
        ret += ll(x%10)*tens[j];
    return ret;
}

string ToSubs(ll x)
{
    string s = "{ ";
    for(int i = 0; i < 9; i++)
    {
        if(x%2 == 1)
            s.push_back(i + '1'), s+=" ";
        x /= 2;
    }
    return (s + "}");
}

bool isIn(int i, int subs)
{
    return (subs & (1<<(i-1)));
}

ll solve(ll bound, int len, int subs, int m){
    ll sum = 0;
    if(len == 0 && bound == 0 && subs == 0 && m == 0)
        return 1;
    if(bound%10 == 0 || subs == 0)
        return 0;
    //if(subs == (1<<7))debug cout << VAR(bound) << VAR(len) << ToSubs(subs) << VAR(m)<<endl;
    for(int i = 1; i <= 9; i++)
    {
        int new_m = (10*mod + m - (i*(tens[len - 1]%mod))) % mod, new_subs = (subs ^ (1<<(i-1)));
        if(i == bound%10)
        {
            if(!isIn(i, subs))
                return sum;
            ll su = solve(bound/10, len - 1, subs, new_m);
            ll sc = solve(bound/10, len - 1, new_subs, new_m);
            return sum + su + sc;
        }
        if(isIn(i, subs))
            sum += dp[len - 1][subs][new_m] + dp[len - 1][new_subs][new_m];
    }
    return sum;
}

int lcm(int sub)
{
    int ret = 1;
    for(int i = 1; i <= 9; i++)
        if(isIn(i, sub))
            ret = ret * i / (__gcd(ret, i));
    return ret;
}

ll AnsForSub(ll bound, int sub)
{
    int g = lcm(sub);
    //debug cout << ToSubs(sub) << VAR(g) << endl;
    ll ret = 0;
    for(int i = 0; i < 2520; i+= g)
        ret += solve(reverse(bound), length(bound), sub, i);
    return ret;
}


void ComputeDp(){
    tens[0] = 1;
    for(int i = 1; i <= 18; i++)
        tens[i] = 10 * tens[i-1];
    dp[0][0][0] = 1;
    for(int len = 1; len < 20; len++)
        for(int j = 0; j < mask; j++)
            for(int k = 0; k < mod; k++)
                for(int i = 1; i <= 9; i++)
                    dp[len][j|(1<<(i-1))][(i*(tens[len - 1]%mod) + k)%mod] += dp[len-1][j][k];
    if(0)debug{
        for(int i = 0; i < mask; i++)
            for(int j = 0; j < mod; j++) if(dp[2][i][j] != 0)
                cout<<ToSubs(i)<< VAR(j) << VAR(dp[2][i][j])<<endl;
    }
}

ll collect(int subs, int len)
{
    int d = lcm(subs); ll ret = 0;
    for(int i = 0; i < 2520; i += d)
        ret += dp[len][subs][i];
    return ret;
}

ll solve(ll x)
{
    if(x == 0)
        return 0;
    int dl = length(x);
    debug cout << VAR(dl) <<VAR(x)<<endl;
    ll ret = 0;
    for(int sub = 0; sub < mask; sub++)
    {
        ll subres = AnsForSub(x, sub);
        ret += subres;
        debug if(subres != 0)
            cout << ToSubs(sub) << VAR(subres)<<endl;
        for(int len = 1; len < dl; len++)
            ret += collect(sub, len);
    }
    return ret;
}

int main(int argc, char* argv[])
{
    ios::sync_with_stdio(false);
    debug; else cin.tie(NULL), cout.tie(NULL);
    ComputeDp();
    ll l, r; cin>>l>>r;
    cout<<solve(r) - solve(l-1)<<"\n";
    return 0;
}