#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
double dot(complex<double> a, complex<double> b) {
	return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
	return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
	return sqrt(a.real() * a.real() + a.imag() * a.imag());
}
double angles(complex<double> a, complex<double> b) {
	double cosine = dot(a, b) / (leng(a) * leng(b));
	double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
	double kaku = acos(cosine);
	if (sine <= 0) {
		kaku = 2 * Ma_PI - kaku;
	}
	return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
	vector<int> ans;
	double now_minnest = a[0].real();
	int now_itr = 0;
	REP(i, a.size()) {
		if (now_minnest > a[i].real()) {
			now_minnest = a[i].real();
			now_itr = i;
		}
	}
	ans.push_back(now_itr);
	complex<double> ba(0, 1);
	while (true) {
		int now_go = 0;
		double now_min = 0;
		int starter = ans[ans.size() - 1];
		for (int i = 0; i < a.size(); ++i) {
			if (i != starter) {
				double goa = angles(ba, a[i] - a[starter]);
				if (goa > now_min) {
					now_min = goa;
					now_go = i;
				}
			}
		}
		if (now_go == ans[0]) break;
		ans.push_back(now_go);
		ba = complex<double>(a[now_go] - a[starter]);
	}
	return ans;
}
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}
long long mod = 0;
#define int long long
vector<int> multi(vector<int> a, vector<int> b) {
	int gogo = sqrt(a.size());
	vector<int> ans;
	REP(i, gogo){
		REP(q,gogo){
			int geko = 0;
			REP(j, gogo) {
				geko += (a[i * gogo + j] * b[j * gogo + q]) % mod;
				geko %= mod;
			}
			ans.push_back(geko);
		}
	}
	return ans;
}
vector<int> powering(vector<int> a, int now) {
	vector<int> ans = a;
	now--;
	while (now != 0) {
		if (now % 2 == 1) {
			ans = multi(ans, a);
		}
		a = multi(a, a);
		now /= 2;
	}
	return ans;
}
#undef int
int main(){
#define int long long
	long long l, a, b;
	cin >> l >> a >> b >> mod;
	vector<long long> ans;
	REP(i, 3) {
		REP(q, 3) {
			if (i == q) {
				ans.push_back(1);
			}
			else {
				ans.push_back(0);
			}
		}
	}
	vector<long long> bases = { 1,0,0,1,1,0,0,b%mod,1 };
	long long now = a;
	long long gogo = 1;
	for (long long digit = 1; digit <= 18; ++digit) {
		bases[0] *= 10LL;
		bases[0] %= mod;
		gogo *= 10LL;
		if (gogo > now) {
			//at least move once
			//move counts!
			long long cnt = (gogo - now + b - 1LL) / b;
			if (cnt >= l) {
				ans = multi(ans, powering(bases, l));
				l = 0;
				break;
			}
			else {
				ans = multi(ans, powering(bases, cnt));
				l -= cnt;
				now += cnt * b;
			}
		}
	}
	long long final_ans = 0;
	final_ans += (a%mod) * ans[3];
	final_ans %= mod;
	final_ans += ans[6];
	final_ans %= mod;
	cout << final_ans << endl;
}

Measured memory_bytes: 256