#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma comment(linker, "/stack:200000000")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;

#define X first
#define Y second

//#include <boost/unordered_map.hpp>
//using namespace boost;

/*
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
rbtree T;
*/

namespace io{
	const int L = (1 << 20) + 1;

	char buf[L], *S , *T, c;

	char getchar() {
		if(__builtin_expect(S == T, 0)) {
			T = (S = buf) + fread(buf, 1, L, stdin);
			return (S == T ? EOF : *S++);
		}
		return *S++;
	}

	int inp() {
		int x = 0, f = 1; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar())
			if(ch == '-') f = -1;
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x * f;
	}

	unsigned inpu()
	{
		unsigned x = 0; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar());
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x;
	}

	ll inp_ll() {
		ll x = 0; int f = 1; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar())
			if(ch == '-') f = -1;
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x * f;
	}

	char B[45], *outs=B+40, *outr=B+40;
	template<class T>
	inline void print(register T a,register char x=0){
		if(x) *--outs = x, x = 0;

		if(!a)*--outs = '0';
		else
			while(a)
				*--outs = (a % 10) + 48, a /= 10;

		if(x)
			*--outs = x;

		fwrite(outs, outr - outs , 1, stdout);
		outs = outr;
	}
};

using io :: print;
using io :: inp;
using io :: inpu;
using io :: inp_ll;

using i32 = int;
using i64 = long long;
using u8 = unsigned char;
using u32 = unsigned;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;
//using i128 = __int128_t;
//using u128 = __uint128_t;
using i128 = i64;
using u128 = u64;

ll power(ll a, ll b, ll p)
{
	if (!b) return 1;
	ll t = power(a, b/2, p);
	t = t*t%p;
	if (b&1) t = t*a%p;
	return t;
}

ll exgcd(ll a, ll b, ll &x, ll &y)
{
	if (b == 0)
	{
		x = 1;
		y = 0;
		return a;
	}
	ll px, py;
	ll d = exgcd(b, a%b, px, py);
	x = py;
	y = px-a/b*py;
	return d;
}

template<class T>
inline void freshmin(T &a, const T &b)
{
	if (a > b) a = b;
}

template<class T>
inline void freshmax(T &a, const T &b)
{
	if (a < b) a = b;
}

const int MOD = 1000000007;
const int INF = 1000000000;
const int MAXN = 100010;
const int MAXK = 20;

ll M;
ll A[3][3], t[3][3], v[3][3];

void calc(ll n)
{
	if (!n)
	{
		for (int i = 0; i < 3; ++ i)
			for (int j = 0; j < 3; ++ j)
				v[i][j] = i == j;
		return;
	}
	calc(n/2);
	for (int i = 0; i < 3; ++ i)
		for (int j = 0; j < 3; ++ j)
		{
			t[i][j] = v[i][j];
			v[i][j] = 0;
		}
	for (int i = 0; i < 3; ++ i)
		for (int j = 0; j < 3; ++ j)
			for (int k = 0; k < 3; ++ k)
				v[i][j] = (v[i][j]+t[i][k]*t[k][j])%M;
	if (n%2)
	{
		for (int i = 0; i < 3; ++ i)
			for (int j = 0; j < 3; ++ j)
			{
				t[i][j] = v[i][j];
				v[i][j] = 0;
			}
		for (int i = 0; i < 3; ++ i)
			for (int j = 0; j < 3; ++ j)
				for (int k = 0; k < 3; ++ k)
					v[i][j] = (v[i][j]+t[i][k]*A[k][j])%M;
	}
}

ll p10[MAXK];
ll idx[MAXK];

int main()
{
	
	ll L, A, B;
	cin >> L >> A >> B >> M;
	
	p10[0] = 1;
	for (int k = 1; k <= 18; ++ k)
	{
		p10[k] = p10[k-1]*10;
		if (p10[k-1] < A)
			idx[k] = 0;
		else
			idx[k] = min(L, (p10[k-1]-A)/B+((p10[k-1]-A)%B > 0));
	}
	idx[19] = L;
	
	ll cur = 0;
	ll sum = 0;
	for (int k = 1; k <= 18; ++ k)
	{
		if (idx[k] < cur) continue;
		ll nxt = idx[k+1];
		
		::A[0][0] = p10[k]%M; ::A[0][1] = 1; ::A[0][2] = 0;
		::A[1][1] = 1; ::A[1][2] = B%M;
		::A[2][2] = 1;
		
		ll si = (A+B*cur)%M;
		calc(nxt-cur);
		sum = (v[0][0]*sum+v[0][1]*si+v[0][2])%M;
		
		cur = nxt;
	}
	cout << sum << endl;
	
	return 0;
}


Measured memory_bytes: 256