#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int,int>
#define vi vector<int>
#define si set<int>
#define unsi unordered_set<int>
#define qi queue<int>
#define sti stack<int>
#define pqi priority_queue<int>
#define mii map<int,int>
#define unmii unordered_map<int,int>
#define fi first
#define se second
#define pb push_back
#define clr(f,n) memset(f,0,sizeof(int)*(n))
#define cpy(f,g,n) memcpy(f,g,sizeof(int)*(n))
int num[20],len,s;
ll f[20][170][170][2];
ll dp(int pt,int p,int sum,bool sm){
    if (sum>s)return 0;
    if (pt<=0)return (!p&&sum==s);
    if (f[pt][p][sum][sm]!=-1)return f[pt][p][sum][sm];
    int lim=(sm)?9:num[pt];ll ans=0;
    for (int i=0;i<=lim;i++){
        ans+=dp(pt-1,(10*p+i)%s,sum+i,sm|(i<num[pt]));
    }
    return f[pt][p][sum][sm]=ans;
}
ll solve(ll x){
    if (!x)return 0;
    len=0;
    while(x){
        num[++len]=x%10;x/=10;
    }ll ans=0;
    for (s=1;s<=len*9;s++){
        memset(f,-1,sizeof(f));
        ans+=dp(len,0,0,0);
    }
    return ans; 
}
int main(){
	freopen ("self.in","r",stdin);
	freopen ("self.out","w",stdout);
	ll a,b;scanf("%lld%lld",&a,&b);
	printf("%lld\n",solve(b)-solve(a-1));
}