#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long LL;
LL L,R;
LL dp[20][163][163];
int a[20],mod;
LL dfs(int d,int ds,int c,bool full){
    if (d==0)
        return (ds==0&&c==0)?1:0;
    if (!full&&dp[d][ds][c]!=-1)
        return dp[d][ds][c];
    LL ans=0;
    int tp=min(ds,full?a[d]:9);
    for (int i=max(0,ds-9*(d-1));i<=tp;i++)
        ans+=dfs(d-1,ds-i,(c*10+i)%mod,full&&i==tp);
    if (!full)
        return dp[d][ds][c]=ans;
    return ans;
}
LL solve(LL n){
    if (n==0)
        return 0;
    int d=0;
    while (n>0)
        a[++d]=n%10,n/=10;
    LL ans=0;
    for (int i=1;i<=d*9;i++){
        memset(dp,-1,sizeof dp);
        mod=i;
        ans+=dfs(d,i,0,1);
    }
    return ans;
}
int main(){
    freopen("self.in","r",stdin);
    freopen("self.out","w",stdout);
    scanf("%lld%lld",&L,&R);
    printf("%lld",solve(R)-solve(L-1));
    fclose(stdin);fclose(stdout);
    return 0;
}