#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = static_modint<90007>;

ll rev(ll x) {
  static VI d;
  d.clear();
  while(x) {
    d.emplace_back(x % 10);
    x /= 10;
  }
  ll res = 0;
  for(int di: d) res = 10 * res + di;
  return res;
}


} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  constexpr ll p = 90007;
  ll q, x, y;
  cin >> q >> q >> x >> y;
  if (y % 10 == 0) y += q;
  ll q_tmp = q;
  while(rev(q_tmp) % p == 0) q_tmp += q;
  q = rev(q_tmp);
  assert(q % p);
  y = rev(y);
  mint now = mint(10).pow(90100) * y;
  string ans(90100, '0');
  while(y) ans += '0' + y % 10, y /= 10;
  mint toadd = x - now;
  if (toadd == 0) {
    reverse(all(ans));
    cout << ans << '\n';
    return 0;
  }
  mint t = toadd / q;
  int c = 0;
  mint ten_c = 1;
  while(t != ten_c) {
    ten_c *= 10;
    c++;
  }
  assert(now + mint(10).pow(c) * q == mint(x));
  while(q) {
    ans[c++] = '0' + q % 10;
    q /= 10;
  }
  reverse(all(ans));
  cout << ans << '\n';
}