#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

int MOD;

struct ModInt {
  int x;
  constexpr ModInt() : x(0) {}
  ModInt(ll s) { if ((x = s % MOD) < 0) x += MOD; }
  ModInt operator+=(ModInt rhs) { if ((x+=rhs.x) >= MOD) x -= MOD; return *this; }
  ModInt operator-=(ModInt rhs) { if ((x-=rhs.x) < 0) x += MOD; return *this; }
  ModInt operator*=(ModInt rhs) { x = (ll)x*rhs.x % MOD; return *this; }
  ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
  ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
  ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
  ModInt operator/=(ModInt rhs) {
    static const ll inv2 = ModInt(2).inv().x; // 2で割るのは特別に保存してみる
    ll i = (rhs.x == 2 ? inv2 : rhs.inv().x);
    x = x*i%MOD; return *this;
  }
  ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
  ModInt inv() { return pow(MOD-2); }
  ModInt pow(ll n) const {
    ModInt r = 1, t = x;
    for (;n;n>>=1,t*=t) if (n&1) r *= t;
    return r;
  }
  static ModInt strnum(const string &n) {ModInt a = 0; for (char c:n) a = a*10+c-'0'; return a;}
  friend ostream& operator<<(ostream &os, const ModInt rhs){ return os << rhs.x; }
};

typedef ModInt mint;

typedef vector<mint> vec;
typedef vector<vec> mat;

ostream &operator<<(ostream &os, const vec &a) {
  FOR(it, a) os << setw(6) << *it << " ";
  return os;
}
ostream &operator<<(ostream &os, const mat &a) {
  FOR(it, a) os << *it << endl;
  return os;
}

vec mul(const mat &A, const vec &b) {
  vec c(A.size());
  REP(i,A.size())
    REP(j,A[i].size())
    c[i] = (c[i] + A[i][j]*b[j]);
  return c;
}

mat mul(const mat &A, const mat &B) {
  mat C(A.size(), vec(B[0].size()));
  REP(i,A.size())
    REP(j,B[0].size())
    REP(k,B.size())
    C[i][j] = (C[i][j] + A[i][k]*B[k][j]);
  return C;
}

mat pow(mat A, ll n) {
  mat B(A.size(), vec(A.size()));
  REP(i,A.size())
    B[i][i] = 1;
  while(n) {
    if (n&1) B = mul(B, A);
    A = mul(A,A);
    n >>= 1;
  }
  return B;
}

ll L,A,B,M;

int getKeta(ll a)
{
  int ans = 0;
  while(a > 0) {
    a /= 10;
    ans++;
  }
  return ans;
}

ll lb(int keta)
{
  ll low = -1, high = L;
  while(low+1 < high) {
    ll mid = (low+high) >> 1;
    if (getKeta(A+B*mid) >= keta) high = mid;
    else low = mid;
  }
  return high;
}

mint get_ten_pow(ll n)
{
  return ModInt(10).pow(n).x;
}

mint get_touhi_sum(mint s, mint r, ll n)
{
  vec v({0,s});
  mat A({{1,1},{0,r}});
  auto res = mul(pow(A, n), v);
  return res[0];
}

mint get_tousa_touhi_sum(mint r, ll n)
{
  vec v({1,r,r});
  mat A({{1,1,1},{0,r,0},{0,r,r}});
  auto res = mul(pow(A, n-1), v);
  return res[0];
}

int main() {
  while(input(L,A,B,M)) {
    MOD = M;
    mint base_ten = 1;
    mint ans = 0;
    for (int keta=20; keta>=1; keta--) {
      ll start = lb(keta);
      ll end = lb(keta+1);
      if (start == end) continue;
      // start, start+1, ..., end-1
      // cout << tpl(start,end,keta,base_ten) << endl;
      // 初項a等差d
      // 初項s等比r
      mint a = A + B * (end - 1);
      mint d = -B;
      mint s = base_ten;
      mint r = mint(10).pow(keta);
      ll n = end - start;
      // cout << tpl("!",n,a,d,s,r) << endl;
      mint one(1);

      // mint t1 = a * (r.pow(n) - 1) * (r-1).inv();
      mint t1 = a * get_touhi_sum(1, r, n);
      // cout << tpl((r.pow(n) - 1) * (r-1).inv(), get_touhi_sum(1, r, n))<< endl;


      // mint t21 = r * (one - mint(n + 1) * r.pow(n) + mint(n) * r.pow(n+1)) * ((one-r)*(one-r)).inv();
      mint t21 = r * get_tousa_touhi_sum(r, n);

      // cout << tpl((one - mint(n + 1) * r.pow(n) + mint(n) * r.pow(n+1)) * ((one-r)*(one-r)).inv(),
      //             get_tousa_touhi_sum(r, n))<< endl;


      mint t22 = mint(n) * r.pow(n);
      mint t2 = d * (t21 - t22);
      mint t = s * (t1 + t2);
      ans += t;
      base_ten *= mint(10).pow(keta).pow(end-start);
    }
    cout << ans << endl;
  }
}


Measured memory_bytes: 256