#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstdlib>
using namespace std;
const int maxn = 31;
long long l,r;
int k,m,len;
int s[maxn];
long long d[maxn][100005];
long long cal(int lim,int pos,int kk,int mod,int c){
if(pos<0) return 1;
if(!lim&&d[pos][mod]!=-1) return d[pos][mod];
int up = 9;
if(lim) up = s[pos];
long long res = 0;
for(int i=0;i<=up;i++){
int tlim = 0,tmod = (mod*10);
if(lim&&i == up) tlim = 1;
if(pos == len-1) {
res += cal(tlim,pos-1,kk||(c+1)>=k,(tmod+i)%m,min(c+1,k));
continue;
}
int tt = tmod/10,flag = 1,tc = c;
while(tt){
tc --;
if(tc == 0) break;
if(i == tt%10) flag = 0;
tt /= 10;
}
if(flag) res += cal(tlim,pos-1,kk||(c+1)>=k,(tmod+i)%m,min(c+1,k));
}
if(!lim) d[pos][mod] = res;
return res;
}
int main(){
while(~scanf("%lld%lld%d",&l,&r,&k)){
memset(d,-1,sizeof d);
l --;
len = 0;
m = 1;
for(int i=0;i<k;i++)
m *= 10;
while(r){
s[len++] = r%10;
r /= 10;
}
long long t1 = cal(1,len-1,0,0,1);
len = 0;
while(l){
s[len++] = l%10;
l /= 10;
}
long long t2 = cal(1,len-1,0,0,1);
printf("%lld\n",t1-t2);
}
return 0;
}
08-09
08-09