#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

/**
 * @attention 使用前にstatic変数Mを設定する。
 */
class RuntimeModInt{
public:
  static uint32_t M;
  
  uint64_t val;
  RuntimeModInt(): val(0){}
  RuntimeModInt(int64_t n){
    if(n >= M) val = n % M;
    else if(n < 0) val = n % M + M;
    val = n;
  }
  
  const RuntimeModInt operator+(const RuntimeModInt &a) const {return RuntimeModInt((val+a.val)%M);}
  const RuntimeModInt operator-(const RuntimeModInt &a) const {return RuntimeModInt((val-a.val+M)%M);}
  const RuntimeModInt operator*(const RuntimeModInt &a) const {return RuntimeModInt((val*a.val)%M);}
  const RuntimeModInt operator/(const RuntimeModInt &a) const {return RuntimeModInt((val*a.inv().val)%M);}
  
  const RuntimeModInt& operator=(const RuntimeModInt &a){val = a.val; return *this;}
  const RuntimeModInt& operator+=(const RuntimeModInt &a){if((val += a.val) >= M) val -= M; return *this;}
  const RuntimeModInt& operator-=(const RuntimeModInt &a){if(val < a.val) val += M; val -= a.val; return *this;}
  const RuntimeModInt& operator*=(const RuntimeModInt &a){(val *= a.val) %= M; return *this;}
  const RuntimeModInt& operator/=(const RuntimeModInt &a){(val *= a.inv().val) %= M; return *this;}

  const bool operator==(const RuntimeModInt &a) const {return val==a.val;}
  const bool operator!=(const RuntimeModInt &a) const {return val!=a.val;}

  const static RuntimeModInt power(LLI n, LLI p){
    RuntimeModInt ret = 1, e = n;
    for(; p; e *= e, p >>= 1) if(p&1) ret *= e;
    return ret;
  }

  const RuntimeModInt power(LLI p) const{
    RuntimeModInt ret = 1, e = val;
    for(; p; e *= e, p >>= 1) if(p&1) ret *= e;
    return ret;
  }
  
  const RuntimeModInt inv() const{
    int64_t a = val, b = M, u = 1, v = 0;

    while(b){
      int64_t t = a/b;
      a -= t*b; swap(a,b);
      u -= t*v; swap(u,v);
    }
    u %= M;
    if(u < 0) u += M;
    
    return u;
  }
};

RuntimeModInt operator+(int64_t a, const RuntimeModInt &b){return RuntimeModInt(RuntimeModInt(a)+b.val);}
RuntimeModInt operator-(int64_t a, const RuntimeModInt &b){return RuntimeModInt(RuntimeModInt(a)-b.val);}
RuntimeModInt operator*(int64_t a, const RuntimeModInt &b){return RuntimeModInt(RuntimeModInt(a)*b.val);}
RuntimeModInt operator/(int64_t a, const RuntimeModInt &b){return RuntimeModInt(RuntimeModInt(a)/b.val);}

uint32_t RuntimeModInt::M;

istream& operator>>(istream &is, RuntimeModInt &a){is >> a.val; return is;}
ostream& operator<<(ostream &os, const RuntimeModInt &a){os << a.val; return os;}

using mint = RuntimeModInt;



template <typename T> struct SquareMatrix{
  int N;
  vector<vector<T>> matrix;
  
  SquareMatrix(int N): N(N), matrix(N, vector<T>(N)){}
  SquareMatrix(const vector<vector<T>> &matrix): N(matrix.size()), matrix(matrix){}
  SquareMatrix(const SquareMatrix<T> &sm): N(sm.N), matrix(sm.matrix){}

  SquareMatrix& operator+=(const SquareMatrix &val){
    REP(i,N) REP(j,N) matrix[i][j] += val[i][j];
    return *this;
  }

  SquareMatrix& operator-=(const SquareMatrix &val){
    REP(i,N) REP(j,N) matrix[i][j] -= val[i][j];
    return *this;
  }

  SquareMatrix& operator*=(const SquareMatrix &val){
    vector<vector<T>> temp(N, vector<T>(N));
    REP(i,N) REP(j,N) REP(k,N) temp[i][j] += matrix[i][k] * val[k][j];
    matrix = temp;
    return *this;
  }

  inline const vector<T> operator[](size_t index) const {return matrix[index];}
  inline vector<T>& operator[](size_t index){return matrix[index];}
  inline int size() const {return N;}
  
  static SquareMatrix<T> make_unit(int N){
    SquareMatrix<T> ret(N);
    REP(i,N) ret[i][i] = 1;
    return ret;
  }

  SquareMatrix<T> transpose(){
    SquareMatrix<T> ret(N);
    REP(i,N) REP(j,N) ret[i][j] = matrix[j][i];
    return ret;
  }

  void debug(){
    REP(i,N){
      cerr << (i==0 ? "⎛" : (i==N-1 ? "⎝" : "⎜"));
      
      REP(j,N){
        cerr << setw(10) << matrix[i][j] << " ";
      }
      cerr << (i==0 ? "⎞" : (i==N-1 ? "⎠" : "⎟"));
      cerr << endl;
    }
  }
};

template <typename T> SquareMatrix<T> operator+(const SquareMatrix<T> &a, const SquareMatrix<T> &b){
  auto ret = a;
  ret += b;
  return ret;
}

template <typename T> SquareMatrix<T> operator-(const SquareMatrix<T> &a, const SquareMatrix<T> &b){
  auto ret = a;
  ret -= b;
  return ret;
}

template <typename T> SquareMatrix<T> operator*(const SquareMatrix<T> &a, const SquareMatrix<T> &b){
  auto ret = a;
  ret *= b;
  return ret;
}

template <typename T> SquareMatrix<T> power(SquareMatrix<T> a, uint64_t p){
  int N = a.size();

  if(p == 0) return SquareMatrix<T>::make_unit(N);
  if(p == 1) return a;
  
  SquareMatrix<T> temp = power(a, p/2);
  SquareMatrix<T> ret = temp * temp;

  if(p%2) ret *= a;
 
  return ret;
}







int main(){
  LLI L,A,B,M;
  while(cin >> L >> A >> B >> M){
    mint::M = M;

    vector<LLI> d(20);
    vector<LLI> cd(20);

    FORE(i,1,18){
      LLI x = powl(10, i);
      d[i] = min(L, max(0LL, (x-A+B-1)/B));
    }

    FORE(i,1,18){
      cd[i] = d[i] - d[i-1];
    }
    
    SquareMatrix<mint> res = SquareMatrix<mint>::make_unit(3);
    
    FORE(i,1,18){
      SquareMatrix<mint> mat({
                        {(LLI)pow(10,i)%M, 0, 0},
                        {1,1,0},
                        {0,B%M,1}
        });

      auto p = power(mat, cd[i]);
      res *= p;
    }

    mint ans = res[1][0]*(A%M) + res[2][0];
    cout << ans << endl;
  }
  
  return 0;
}


Measured memory_bytes: 512