#include <bits/stdc++.h>

#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define rsort(v) sort(all(v)); reverse(all(v))

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }

i64 L, A, B, M;

struct ModInt {
  int x;
  ModInt(): x(0) {}
  ModInt(i64 a) { x = a % M; if (x < 0) x += M; }
  ModInt &operator+=(ModInt that) { x = (x + that.x) % M; return *this; }
  ModInt &operator-=(ModInt that) { x = (x + M - that.x) % M; return *this; }
  ModInt &operator*=(ModInt that) { x = (i64) x * that.x % M; return *this; }
  ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
  ModInt operator-() { return ModInt(-this->x); }
  friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; }
  ModInt inverse() {
    int a = x, b = M, u = 1, v = 0;
    while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); }
    return ModInt(u);
  }
  #define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; }
    op(+, +=) op(-, -=) op(*, *=) op(/, /=)
  #undef op
  #define op(o) bool operator o(ModInt that) const { return x o that.x; }
    op(==) op(!=) op(<) op(<=) op(>) op(>=)
  #undef op
};

using mint = ModInt;

void solve() {
  cin >> L >> A >> B >> M;
  vi64 cnt(19);
  reps(i, 18) {
    i64 c = (power((i64) 10, i) + B - A) / B;
    if (B * c == power((i64) 10, i) + B - A) c--;
    cnt[i] = c < 0 ? 0 : c;
  }
  rreps(i, 18) cnt[i] -= cnt[i - 1];

  mint t;
  function<mint(i64)> g = [&](i64 n) -> mint {
    if (n == 1) return 1;
    if (n % 2 == 0) {
      n /= 2;
      return g(n) * (power(t, n) + 1);
    } else {
      n -= 1;
      return g(n) + power(t, n);
    }
  };
  function<mint(i64)> h = [&](i64 n) -> mint {
    if (n == 1) return 0;
    if (n % 2 == 0) {
      n /= 2;
      return h(n) * (power(t, n) + 1) + g(n) * n;
    } else {
      n -= 1;
      return h(n) + g(n);
    }
  };
  function<mint(i64, i64, i64)> f = [&](i64 n, i64 x, i64 y) -> mint {
    return g(n) * x + h(n) * y;
  };

  mint ans = 0;
  i64 s = 1;
  reps(i, 18) {
    i64 c = min(L, cnt[i]);
    if (c == 0) continue;

    t = power((mint) 10, i);
    ans *= power(t, c);
    ans += f(c, A + B * (s - 1), B);
    
    L -= c, s += c;
  }
  cout << ans << '\n';
}


Measured memory_bytes: 256