#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
  {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
  {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
  {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
  #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
  #define dump(...)
  #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
// *************** TEMPLATE END *************** 

template <class T>
T pow(T x, int n, const T UNION = 1) {
  T ret = UNION;
  while (n) {
    if (n & 1) ret *= x;
    x *= x; n >>= 1;
  }
  return ret;
}

// ModInt::set_mod(m)してから使う
struct ModInt {
  static int MD;
  static map<pair<int, int>, int> tbl_pow;
  static void set_mod(int mod) { MD = mod; tbl_pow.clear(); }
  int x;
  ModInt() : x(0) {}
  ModInt(int x_) { if ((x = x_ % MD + MD) >= MD) x -= MD; }

  ModInt& operator+=(ModInt that) { if ((x += that.x) >= MD) x -= MD; return *this; }
  ModInt& operator*=(ModInt that) { x = (unsigned long long)x * that.x % MD; return *this; }
  ModInt& operator-=(ModInt that) { if ((x -= that.x) < 0) x += MD; return *this; }
  ModInt& operator/=(ModInt that) { x = (unsigned long long)x * that.inv().x % MD; return *this; }

  ModInt operator-() const { return -x < 0 ? MD - x : -x; }
  ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
  ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
  ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
  ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
  bool operator==(ModInt that) const { return x == that.x; }
  bool operator!=(ModInt that) const { return x != that.x; }
  ModInt inv() const { return pow(*this, MD - 2); }
  friend ostream& operator<<(ostream& s, ModInt a) { s << a.x; return s; }
  friend istream& operator>>(istream& s, ModInt& a) { s >> a.x; return s; }

  ModInt save_pow(int n) const {
    if (tbl_pow.count({x, n})) return tbl_pow[{x, n}];
    if (n == 0) return 1;
    if (n % 2) return tbl_pow[{x, n}] = (*this * save_pow(n - 1)).x;
    return tbl_pow[{x, n}] = (save_pow(n / 2) * save_pow(n / 2)).x;
  }
  // 1 + r + r^2 + ... + r^(n-1)
  static ModInt geometric_progression(ModInt r, int n) {
    if (n == 0) return 0;
    if (n % 2) return geometric_progression(r, n - 1) + r.save_pow(n - 1);
    return geometric_progression(r, n / 2) * (r.save_pow(n / 2) + 1);
  }
  // a + r * (a - d) + r^2 * (a - 2d) + ... + r^(n-1) * (a - (n - 1)d)
  static ModInt linear_sum(ModInt r, ModInt a, ModInt d, int n) {
    if (n == 0) return 0;
    if (n % 2) return linear_sum(r, a, d, n - 1) + r.save_pow(n - 1) * (a - d * (n - 1));
    return linear_sum(r, a, d, n / 2) * (r.save_pow(n / 2) + 1) - d * (n / 2) * r.save_pow(n / 2) * geometric_progression(r, n / 2);
  }
};
int ModInt::MD = 1000000007;
using mint = ModInt;
map<pair<int, int>, int> mint::tbl_pow;

vector<mint> fact, fact_inv;
void init_factorial(int n) {
  fact = vector<mint>(n + 1, 1);
  fact_inv = vector<mint>(n + 1);
  for (int i = 0; i < n; i++) fact[i + 1] = fact[i] * (i + 1);
  fact_inv[n] = mint(1) / fact[n];
  for (int i = n - 1; i >= 0; i--) fact_inv[i] = fact_inv[i + 1] * (i + 1);
  // for (int i = 0; i < n + 1; i++) assert(fact[i] * fact_inv[i] == 1);
}
mint comb(int n, int r) {
  return fact[n] * fact_inv[r] * fact_inv[n - r];
}

int count(int x) {
  return to_string(x).size();
}
signed main() {
  int L, a, d, M; cin >> L >> a >> d >> M;
  mint::set_mod(M);
  auto ith = [&](int i) {
    return a + d * i;
  };

  mint ans = 0, base = 1;
  int last = L - 1;
  while (last >= 0) {
    int len = count(ith(last));
    int ok = last, ng = -1;
    while (abs(ok - ng) > 1) {
      int m = (ok + ng) / 2;
      (count(ith(m)) == len ? ok : ng) = m;
    }
    int num = last - ok + 1;
    mint r = pow(mint(10), len);
    ans += base * mint::linear_sum(r, ith(last), d, num);

    base *= pow(r, num);
    last = ng;
  }
  cout << ans << endl;
}


Measured memory_bytes: 384