#include<iostream>
using namespace std;
long P,K;
const long mod=1e9+7;
long dp[1<<20];
int ex[1<<20];
long power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
main()
{
	cin>>P>>K;
	long ans=0;
	long now=1;
	int turn=0;
	while(!ex[now])
	{
		++turn;
		ex[now]=turn;
		dp[now]=ans;
		now=now*10;
		ans=(ans*10+now/P)%mod;
		now%=P;
	}
	if(turn-ex[now]+1!=P-1)return 1;
	ans=(ans-dp[now]*power(10,turn-ex[now]+1)%mod+mod)%mod;
	if(K==0)ans=(ans+1)%mod;
	cout<<ans<<endl;
}