1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cmath>
 5 #include<algorithm>
 6 #include<queue>
 7 #include<cstdlib>
 8 #include<iomanip>
 9 #include<cassert>
10 #include<climits>
11 #define maxn 1000001
12 #define F(i,j,k) for(int i=j;i<=k;i++)
13 #define M(a,b) memset(a,b,sizeof(a))
14 #define FF(i,j,k) for(int i=j;i>=k;i--)
15 #define inf 0x7fffffff
16 using namespace std;
17 int read(){
18     int x=0,f=1;char ch=getchar();
19     while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
20     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
21     return x*f;
22 }
23 int n,m;
24 int f[82][10][82][82],pwr[82][10];;
25 int sum,L,R;
26 int num[10];
27 inline int modabs (int a, int mod)
28 {
29     return ((a % mod)+mod)%mod;
30 }
31 int run(int p,int sum,int mod,int s,bool e)
32 {
33     int a,b;
34     if(s-sum<0) return 0;
35     else if(!e) return f[s][p+1][s-sum][(s-mod)%s];
36     else if(p==-1)
37     {
38         if(sum==s&&mod==0) return 1;
39         else return 0;
40     }
41     else
42     {
43         int res=0;
44     F(d,0,num[p])
45     {
46         res+=run(p-1,sum+d,(mod+pwr[s][p]*d)%s,s,d==num[p]);
47     }
48     return res;
49     }
50 }
51 int fcount(int t)
52 {
53     int a,b;
54     if(t==0) return 0;
55     int maxx=0;
56     while(t){
57         num[maxx++]=t%10;
58         t/=10;
59     }
60     int res=0;
61     F(i,1,81) res+=run(maxx-1,0,0,i,true);
62     return res;
63 }
64 int main()
65 {
66     std::ios::sync_with_stdio(false);//cout<<setiosflags(ios::fixed)<<setprecision(1)<<y;
67     #ifdef LOCAL
68     freopen("data.in","r",stdin);
69     freopen("data.out","w",stdout);
70     #endif
71     F(s,1,81)
72     {
73         M(f[s],0);
74         f[s][0][0][0]=1;
75         pwr[s][0]=1%s;
76         F(i,1,9) pwr[s][i]=(pwr[s][i-1]*10)%s;
77         F(i,1,9)F(j,0,i*9)F(k,0,s)for(int d=0;d<=9&&j-d>=0;d++)
78         {
79             f[s][i][j][k]+=f[s][i-1][j-d][modabs(k-pwr[s][i-1]*d,s)];
80         }
81     }
82     while(cin>>L>>R)
83     {
84         cout<<fcount(R)-fcount(L-1)<<endl;
85     }
86     return 0;
87 }