#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
// const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

ll mod;

ll mod_pow(ll a, ll n) {
	if(n == 0) return 1;
	ll res = mod_pow(a, n / 2);
	if(n % 2 == 0) return res * res % mod;
	else return a * res % mod * res % mod;
}

mat mat_mul(const mat &A, const mat &B) {//if invalid, assert. taking mod.
	assert((int)A[0].size() == (int)B.size());
	mat C(A.size(), vl(B[0].size()));
	rep(i, 0, (int)A.size()) {
		rep(k, 0, (int)B.size()) {
			rep(j, 0, (int)B[0].size()) {
				C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % mod;
			}
		}
	}
	return C;
}

mat mat_pow(mat A, ll n) {
	mat B((int)A.size(), vl((int)A.size()));
	rep(i, 0, (int)A.size()) {
		B[i][i] = 1;
	}
	while(n > 0) {
		if(n & 1) B = mat_mul(B, A);
		A = mat_mul(A, A);
		n >>= 1;
	}
	return B;
}

ll L, A, B;
pl P[20];
ll C[20];
ll E[20];

void solve() {
	cin >> L >> A >> B >> mod;
	ll tmp = 1;
	ll at = 0;

	int i = 0;
	while(at != L) {
		tmp *= 10;
		if(A + B * at >= tmp) P[i].fst = at, P[i].sec = at;
		else {
			ll ok = at, ng = L;
			while(abs(ok - ng) > 1) {
				ll m = (ok + ng) / 2;
				if(A + B * m < tmp) ok = m;
				else ng = m;
			}
			P[i].fst = at, P[i].sec = ok + 1;
			at = ok + 1;
		}
		i++;
	}
	int M = i;

	tmp = 1;
	rep(i, 0, M) {
		MUL(tmp, 10);
		mat D = mat(3, vl(3, 0));
		D[0][0] = tmp;
		D[1][0] = tmp;
		D[1][1] = tmp;
		D[2][0] = (A + B * (P[i].sec - 1)) % mod;
		D[2][1] = (mod - B % mod) % mod;
		D[2][2] = 1;

		mat vec = mat(3, vl(1, 0)); vec[0][0] = 1;
		auto R = mat_mul(mat_pow(D, P[i].sec - P[i].fst), vec);
		C[i] = R[2][0];
		E[i] = R[0][0];
		// debug(i, C[i], E[i], P[i], tmp);
	}
	ll res = 0;
	tmp = 1;
	rer(i, M, 0) {
		ADD(res, C[i] * tmp % mod);
		MUL(tmp, E[i]);
	}
	cout << res << "\n";
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 256