#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=200010;
const int MAX=1000000100;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
int b[20],e[20],f[20],q[20][1050][20];
ll dp[20][1050][20];
ll dfs(int bo,int i,int j,int k) {
if (i==0&&k==0) return 1;
if ((i==0&&k!=0)||k<0) return 0;
if (bo&&q[i][j][k]) return dp[i][j][k];
if (bo) {
ll& ret=dp[i][j][k];
q[i][j][k]=1;
for (int h=0;h<10;h++)
if (j&e[h]) ret+=dfs(1,i-1,j&f[h],k);
else ret+=dfs(1,i-1,(j&f[h])|e[h],k-(h!=0));
return ret;
} else {
ll ret=0;
if (j&e[b[i]]) ret+=dfs(0,i-1,j&f[b[i]],k);
else ret+=dfs(0,i-1,(j&f[b[i]])|e[b[i]],k-(b[i]!=0));
for (int h=0;h<b[i];h++)
if (j&e[h]) ret+=dfs(1,i-1,j&f[h],k);
else ret+=dfs(1,i-1,(j&f[h])|e[h],k-(h!=0));
return ret;
}
}
ll get(ll x,int g) {
int i,k=0;
while (x) { b[++k]=x%10;x/=10; }
return dfs(0,k,0,g);
}
int main()
{
int i,k;
ll l,r;
memset(q,0,sizeof(q));
memset(dp,0,sizeof(dp));
e[0]=f[0]=0;
for (i=1;i<20;i++) e[i]=1<<(i-1),f[i]=(1<<i)-1;
scanf("%I64d%I64d%d", &l, &r, &k);
printf("%I64d\n", get(r,k)-get(l-1,k));
return 0;
}