#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

int modpow(int x, int n, int m){
    int a = 1;
    IREP(i, 64){
        a = (a * a) % m;
        if(((n >> i) & 1) == 1) a = (a * x) % m;
    }
    return a;
}

int digitnum(int x){
    int n = 0;
    while(x){
        x /= 10;
        n++;
    }
    return n;
}

int modsum1(int D, int n, int M){
    //int S = 0;
    //REP(i, n) S = (S + modpow(D, i, M)) % M;
    int S = 0;
    int now = 0;
    IREP(i, 64){
        if(now > 0){ 
            S = (S * (1 + modpow(D, now, M))) % M;
            now *= 2;
            if(((n >> i) & 1) == 1) {
                S += modpow(D, now, M);
                S %= M;
                now++;
            }
        }else if(((n >> i) & 1) == 1){
            S = 1;
            now = 1;
        }
    }

    return S;
}

int modsum2(int D, int n, int M){
    //int S = 0;
    //REP(i, n) S = (S + i * modpow(D, i, M)) % M;
    
    int S = 0;
    int now = 0;
    IREP(i, 64){
        if(now > 0){ 
            int T = (S * modpow(D, now, M)) % M;
            int U = (modsum1(D, 2 * now, M) - modsum1(D, now, M) + M) % M;
            U = ((now % M) * U) % M;
            S = (S + T + U) % M;
            now *= 2;
            if(((n >> i) & 1) == 1) {
                S += ((now % M) * modpow(D, now, M)) % M;
                S %= M;
                now++;
            }
        }else if(((n >> i) & 1) == 1){
            S = 0;
            now = 1;
        }
    }

    return S;
}

signed main(){

    int L, A, B, M; cin >> L >> A >> B >> M;
    int dmin = digitnum(A), dmax = digitnum(A + B * (L - 1));
    mat di(18 + 1, vec(2, -1));

    int s = 0;
    FOR(d, dmin, dmax + 1){
        if(digitnum(A + B * s) != d) continue;
        di[d][0] = s;
        if(d == dmax) di[d][1] = L - 1;
        else{
            int i0 = s, i1 = L - 1;
            while(i1 - i0 > 1){
                int i = (i0 + i1) / 2;
                if(digitnum(A + B * i) == d) i0 = i;
                else i1 = i;
            }
            di[d][1] = i0;
            s = i1;
        }
    }
    //mdebug(di);

    int K = 1;
    int ans = 0;
    IFOR(d, 1, 18 + 1){
        if(di[d][0] == -1) continue;
        int n = di[d][1] - di[d][0] + 1;
        int a = A + B * di[d][1];
        int D = modpow(10, d, M);

        /*
        REP(i, n){
            int x1 = (a - B * i) % M;
            int x2 = modpow(D, i, M);

            ans += ((x1 * x2) % M) * K;
            ans %= M;
        }*/
        int tmp1 = 0, tmp2 = 0;
        tmp1 = ((a % M) * modsum1(D, n, M)) % M;
        tmp2 = ((B % M) * modsum2(D, n, M)) % M;
        ans += (tmp1 - tmp2 + M) * K;
        ans %= M;

        K = (K * modpow(D, n, M)) % M;
    }
    Out(ans);


    return 0;
}


Measured memory_bytes: 256