/*****************************************
Note：
******************************************/
#include <queue>
#include <set>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
#define LL long long
int l,r,mod;
int a[N],dp[15][105][105];
int dfs(int len,int pre,bool limit)
{
	if(len==-1)
		return pre==0?1:0;
	if(!limit&&~dp[len][pre][mod])
		return dp[len][pre][mod];
	int up=limit?a[len]:9;
	int ans=0;
	for(int i=0;i<=up;i++)
		ans+=dfs(len-1,(pre+i)%mod,limit&&i==a[len]);
	if(!limit)
		dp[len][pre][mod]=ans;
	return ans;
}
int find(int x)
{
	memset(dp,-1,sizeof dp);
	int len=0;
	while(x)
	{
		a[len++]=x%10;
		x/=10; 
	}
	return dfs(len-1,0,true);
}
int main()
{
	while(scanf("%d%d%d",&l,&r,&mod)!=EOF)
	{
		memset(dp,-1,sizeof dp);
		cout<<find(r)-find(l-1)<<endl;
	}
	return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
#define int long long
using namespace std;
const int N=1e6+5;
const int INF=0x3f3f3f3f;
int n,m,a[N],dp[20][3];
int dfs(int len,int f,int flag){
	if(len==-1)return 1;
	if(!flag&&dp[len][f==6]!=0)return dp[len][f==6];
	int nid=flag?a[len]:9;
	int ans=0;
	for(int i=0;i<=nid;i++){
		if((i==4)||(i==2&&f==6))continue;
		ans+=dfs(len-1,i,flag&&i==a[len]);
	}
	if(!flag){
		dp[len][f==6]=ans;
	}
	return ans;
}
int find(int num){
	int len=0;
	while(num!=0){
		a[len]=num%10;
		len++;
		num/=10;
	}
	return dfs(len-1,-1,true);
}
signed main(){
	while(scanf("%lld%lld",&n,&m)){
		if(n==0&&m==0)return 0;
		cout << find(m)-find(n-1) << endl;
	}
	return 0;
}