#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
int MOD = 1000000007;
const int INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;
/* ---------------------------------------------------------------------------------------------------- */

template <typename T>
struct Matrix {
  vector<vector<T>> A;
  Matrix() {}
  Matrix(size_t n, size_t m) : A(n,vector<T>(m,0)) {}
  Matrix(size_t n) : A(n, vector<T>(n,0)) {}
  size_t height() const {
    return (A.size());
  }
  size_t width() const {
    return (A[0].size());
  }
  inline const vector<T> &operator[](int k) const {
    return (A.at(k));
  }
  inline vector<T> &operator[](int k) {
    return (A.at(k));
  }
  static Matrix I(size_t n) {
    Matrix mat(n);
    for (int i = 0; i < n; i++) mat[i][i] = 1;
    return (mat);
  }
  Matrix &operator+=(const Matrix &B) {
    size_t n = height(), m = width();
    assert(n == B.height() && m == B.width());
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
        ((*this)[i][j] += B[i][j]) %= MOD;
    return (*this);
  }
  Matrix &operator-=(const Matrix &B) {
    size_t n = height(), m = width();
    assert(n == B.height() && m == B.width());
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
        ((*this)[i][j] += MOD - B[i][j]) %= MOD;
    return (*this);
  }
  Matrix &operator*=(const Matrix &B) {
    size_t n = height(), m = B.width(), p = width();
    assert(p == B.height());
    vector<vector<T>> C(n,vector<T>(m,0));
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
        for (int k = 0; k < p; k++)
          C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j] % MOD) % MOD;
    A.swap(C);
    return (*this);
  }
  Matrix &operator^=(int k) {
    Matrix B = Matrix::I(height());
    while (k > 0) {
      if (k & 1) B *= *this;
      *this *= *this;
      k >>= 1;
    }
    A.swap(B.A);
    return (*this);
  }
  Matrix operator+(const Matrix &B) const {
    return (Matrix(*this) += B);
  }
  Matrix operator-(const Matrix &B) const {
    return (Matrix(*this) += MOD - B);
  }
  Matrix operator*(const Matrix &B) const {
    return (Matrix(*this) *= B);
  }
  Matrix operator^(const int k) const {
    return (Matrix(*this) ^= k);
  }
  friend ostream &operator<<(ostream &os, Matrix &p) {
    size_t n = p.height(), m = p.width();
    for (int i = 0; i < n; i++) {
      os << "[";
      for (int j = 0; j < m; j++) {
        os << p[i][j] << (j + 1 == m ? "]\n" : ".");
      }
    }
    return (os);
  }
};

int pow10(int x) {
  int res = 1;
  while (x) {
    res *= 10;
    x--;
  }
  return res;
}

int L,A,B,M;

signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  cin >> L >> A >> B >> M;
  MOD = M;
  int lb = 0;
  int ans = 0;
  for (int d = 1; d <= 18 && lb < L; d++) {
    int pw = pow10(d);
    if (!(A+B*lb < pw)) continue;
    int ok = lb, ng = L;
    while (ng - ok > 1) {
      int mid = (ok + ng) / 2;
      if (A+B*mid < pw) ok = mid;
      else ng = mid;
    }
    int ub = ok;
    Matrix<int> P(3,3),X(3,1);
    P[0][0] = pw%MOD; P[0][1] = 1; P[0][2] = 0;
    P[1][0] =  0; P[1][1] = 1; P[1][2] = B%MOD;
    P[2][0] =  0; P[2][1] = 0; P[2][2] = 1;
    X[0][0] = ans%MOD; X[1][0] = (A+B*lb%MOD)%MOD; X[2][0] = 1;
    X = (P^(ub-lb+1))*X;
    ans = X[0][0];
    lb = ub+1;
  }
  cout << ans << endl;

  return 0;
}

Measured memory_bytes: 256