#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod;
ll rui(ll number1,ll number2){

    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){

    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){

    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){

    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

/*
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
	rfact[800000] = rui(fact[800000],mod - 2);
	for(ll i=800000; i>=1; i--){
	   rfact[i-1] = rfact[i] * i;
	   rfact[i-1] %= mod;
	}
	return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}
*/

ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q,l,r,idx;
ll x[500005],y[500005],z[500005];
char s[500005];

ll norma = 0;
bool checked[500005][3];
ll dp[500005][3];
//bool used[500005];
bool flag,dame;

ll part(ll n){
    return (a + b * ((n - 1)));
}

ll base(ll n){
    if(n == 1){
        return 1;
    }else if(n % 2 == 0){
        return (base(n/2) * (rui(norma,n/2) + 1)) % mod;
    }else{
        return (base(n - 1) * norma + 1) % mod;
    }
}

ll solve(ll start,ll end){
    ll kousuu = end - start + 1;
    if(end < start)p("!!\n");
    if(start == end){
        return (part(start)) % mod;
    }else if(kousuu % 2 == 0){
        ll num = solve(start,(start+end)/2);
        num *= ((rui(norma,kousuu / 2) + 1)) % mod;
        num %= mod;
        num += ((b * (kousuu / 2)) % mod) * base(kousuu / 2) % mod;
        num %= mod;
        return num;
    }else{
        ll num = (solve(start,end-1) * norma) % mod + (part(end)) % mod;
        return num % mod;
    }
}


int main(){

	cin >> n >> a >> b >> mod;
    
    c = 1;
    while(c <= a){
        c *= 10;
    }
    norma = c % mod;
    ll start,end;
    start = 1;
    ll res = 0;
    num = 0;
    while(1){
        while(c <= part(start)){
            c *= 10;
        }
       // p(c);
        norma = c % mod;
        //if(num >= 8)break;
       // pe(start);
        end = ((c - part(start) - 1) / b) + start;
        
        if(end > n)end = n;
       // p(end);
        ll leftres = res;
        ans = solve(start,end);
        res = (leftres * rui(norma,end-start+1)) % mod;
        res += ans;
        res %= mod;
        start = end + 1;
        if(end == n)break;
        //p(res);
    }
    p(res);
    
	return 0;
}

Measured memory_bytes: 14848