// 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 L, A, B, M;
int mod;
struct mint {
  int x;
  mint(int x=0):x(x%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;
}


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

mint f(int x, int d){
  if (x==1) return 1;
  if (x%2==0){
    mint p = f(x/2, d);
    return (p + (pow_(pow_(10,d), (x/2))*p));
  }
  else{
    mint p = f(x-1, d);
    return (p + pow_(pow_(10, d), (x-1)));
  }
}

mint g(int x, int d){
  if (x==1) return pow_(10,d);
  mint ans = 0;
  if (x%2==0){
    int y = x/2;
    mint p = g(y, d);
    ans += p;
    ans += p * pow_(pow_(10,d),y);
    ans += f(y, d) * mint(y) * pow_(pow_(10,d),(y+1));
    return ans;
  }
  else{
    ans += g(x-1, d) + mint(x) * pow_(pow_(10,d), x);
    return ans;
  }
}

pii num(int d){/*{{{*/
  int m=1;
  rep(i,d) m*=10;
  if ((m-1)-A<0) return mp(-1,-1);
  int n = ((m-1)-A)/B;

  int last = min(n, L-1);

  m /= 10;
  int prelast;
  if ((m-1)-A<0) {
    prelast = -1;
  }
  else{
    n = ((m-1)-A)/B;
    prelast = min(n, L-1);
  }
  return mp(prelast, last);
}/*}}}*/


int solve(){
  cin>>L>>A>>B>>M;
  mod = M;
  dump(mod);

  mint ans = 0;
  rep(d, 1, 19){
    int fst,last;
    tie(fst,last) = num(d);
    fst++;
    int n = last - fst + 1;
    if (n==0) continue;

    ans *= pow_(pow_(10,d), n);
    ans += (mint(A)+(mint(last)*mint(B))) * f(n, d);
    if (n>1) ans -= g(n-1, d) * mint(B);
  }
  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