// template version 1.12
using namespace std;
#include <iostream>
#include <bits/stdc++.h>

// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF=1e18;
const int MOD=1e9+7; //}}}

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
  #include "lib/dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}

int mod;
struct mint { //逆元などを使いたければmint2{{{
  int x;
  mint(int x=0):x((x%mod+mod)%mod){}
  mint& operator+=(const mint a) {
    (x += a.x) %= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    (x += mod-a.x) %= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res+=a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res-=a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res*=a;
  }
};
ostream& operator<<(ostream& os, const mint& a){
  os << a.x;
  return os;
} //}}}

using value=int;
using mat=vector<vector<value>>;

mat mul(mat& A, mat& B){
  mat res(A.size(), vector<value>(B[0].size()));
  rep(i, A.size()){
    rep(j, B[0].size()){
      rep(k, B.size()){
        res[i][j] = (res[i][j]+A[i][k]*B[k][j])%mod; // remove %MOD if not needed
      }
    }
  }
  return res;
}

mat pow(mat A, int n){
  mat B(A.size(), vector<value>(A.size()));
  rep(i, A.size()){
    B[i][i]=1;  // E
  }
  while (n>0) {
    if (n & 1) B = mul(B, A);
    A = mul(A, A);
    n >>= 1;
  }
  return B;
}

int pow_(int b, int x){ //{{{
  if (x==1) return b%mod;
  if (x%2==0){
    int t = pow_(b, x/2);
    return (t*t)%mod;
  }
  else{
    return pow_(b, x-1)*b%mod;
  }
} //}}}

int solve(){
  int L,a,b,M;
  cin>>L>>a>>b>>M;
  mod = M;

  auto num = [&](int d) -> pii{
    int ten = 1;
    rep(i, d-1) ten*=10;
    // [ten-a, ten*10-a-1]
    if (ten*10-a-1<0) return mp(-1, -1);
    if ((ten-a+b-1)/b>L-1) return mp(-1, -1);
    int l = max((ten-a+b-1)/b, 0LL);
    int r = min((ten*10-a-1)/b, L-1);
    return mp(l, r);
  };

  mint ans = 0;
  int tenp = 1;
  rep(d, 1, 19){
    int l,r;
    tie(l, r) = num(d);
    int nd = (r-l+1);
    tenp *= 10; tenp %= mod;

    if (nd<=0 || (r==-1 && l==-1)) continue;
    ans *= pow_(tenp, nd);
    mat A(3, vi(3, 0));
    A[0] = {tenp, 1, 1};
    A[1] = {0,    1, 1};
    A[2] = {0,    0, 1};

    mat F(3, vi(1));
    F[0][0] = (a + b * l)%mod;
    F[1][0] = (a + b * l)%mod;
    F[2][0] = b%mod;

    mat B = pow(A, nd-1);
    ans += mul(B, F)[0][0];
  }
  cout << ans << endl;

  return 0;
}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
  solve();
  return 0;
} //}}}


Measured memory_bytes: 256