#include<iostream>
#include<set>
using namespace std;
long P,K;
const long mod=1e9+7;
main()
{
	cin>>P>>K;
	long ans=0;
	long now=1;
	set<long>S;
	while(S.find(now)==S.end())
	{
		S.insert(now);
		now=now*10;
		ans=(ans*10+now/P)%mod;
		now%=P;
	}
	if(K==0)ans=(ans+1)%mod;
	cout<<ans<<endl;
}