// C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(ll __x = __start; __x < __end; __x++)

int main() {
  ll n, m; cin >> n >> m;
  vector<ll> D;
  for (ll i=1; i*i<=m; i++) {
    if (m%i == 0) {
      D.push_back(i);
      if (i*i<=m) D.push_back(m/i);
    }
  }
  
  sort(D.rbegin(), D.rend());
  
  for (auto &&d: D) {
    if (n*d <= m) {
      cout << d << endl;
      return 0;
    }
  }
  
  cout << -1 << endl;
  return 0;
}

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h> 
using namespace std;

typedef long long ll;

#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0) 
#define rep(pp,nn) for (int i = pp; i < nn; ++i)
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define endl "\n"

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

string int_to_string(int x) {
    stringstream ss;
	ss << x;
	string ni = ss.str();
	return ni;
}
int string_to_int(string x) {
	int n;
	stringstream s(x);
	s >> n;
	return n;
}

int64_t power_mod(ll a, ll b, ll mo) {
	ll ans = 1;
	while (b) {
		if(b & 1) {
			ans = (ans % mo * a % mo) % mo;
		}
		a = (a % mo * a % mo) % mo;
		b /= 2;
	}
	return ans;
}
int64_t POW(ll a, ll b) {
	ll ans = 1;
	while (b) {
		if(b & 1) {
			ans = ans * a;
		}
		a = a * a;
		b /= 2;
	}
	return ans;
}

vector<int64_t> INVERSE(int64_t nn, int64_t mo) {
	vector<int64_t> inv(nn + 1);
	vector<int64_t> mul(nn + 1);
	inv[0] = 1;
    inv[1] = 1;
	for (ll i = 2; i <= nn; ++i) {
		inv[i] = (mo - (mo / i) * inv[mo % i] % mo) % mo; 
	}
	mul[0] = 1;
	for (int i = 1; i <= nn; ++i) {
		mul[i] = (mul[i - 1] * inv[i]) % mo;
	}
	return mul;
}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

int mod = 1e9 + 7;

void add_self(int &a , int b) {
	a += b;
	if (a >= mod) {
		a -= mod;
	}
}

int main() {
	IOS; //READ THE QUESTION PROPERLY BSDK
	string s;
	int d;
	cin >> s >> d;
	int n = (int)s.size();
	vector<vector<int>> dp(d,vector<int> (2));
	//int m = 1e9 + 7;
	dp[0][0] = 1;
	for (int i = 0; i < n; ++i) {
		vector<vector<int>> new_dp(d, vector<int> (2));
		for (int j = 0; j < d; ++j) {
			for (bool sm_already : {false, true}) {
				for (int digit = 0; digit < 10; ++digit) { 
					if (digit > s[i] - '0' && !sm_already) {
						break;
					} 
				//debug(j,dp[j][0], s[i] - '0',digit,i);
					add_self(new_dp[(j + digit) % d][sm_already || (digit < s[i] - '0')],dp[j][sm_already]);
			    }
			}
		}
		//adebug(new_dp);
		dp = new_dp;
	}
	int answer = (dp[0][0] + dp[0][1]) % mod;
	answer--;
	if (answer == -1) {
		answer = mod - 1;
	}
	cout << answer;
}



























