#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define ef else if
#define UR assert(false)

// ---- ----

template<int N = 0> class ModInt {
private:
	LL v = 0;
	static LL m;
public:
	ModInt() { }
	ModInt(LL vv) { setval(vv); }
	ModInt & setval(LL vv) { v = vv % m; if(v < 0) { v += m; } return (*this); }
	static void setmod(LL mm) { m = mm; }
	LL getval() const { return v; }
	ModInt & operator+=(const ModInt & b)       { return setval(v + b.v); }
	ModInt & operator-=(const ModInt & b)       { return setval(v - b.v); }
	ModInt & operator*=(const ModInt & b)       { return setval(v * b.v); }
	ModInt & operator/=(const ModInt & b)       { return setval(v * b.inv()); }
	ModInt & operator^=(            LU b)       { return setval(ex(v, b)); }
	ModInt   operator+ (                ) const { return ModInt(+v); }
	ModInt   operator- (                ) const { return ModInt(-v); }
	ModInt   operator+ (const ModInt & b) const { return ModInt(v + b.v); }
	ModInt   operator- (const ModInt & b) const { return ModInt(v - b.v); }
	ModInt   operator* (const ModInt & b) const { return ModInt(v * b.v); }
	ModInt   operator/ (const ModInt & b) const { return ModInt(v * b.inv()); }
	ModInt   operator^ (            LU b) const { return ModInt(ex(v, b)); }
	LL inv() const {
		LL x = (ex_gcd(v, m).FI + m) % m;
		assert(v * x % m == 1);
		return x;
	}
	LL ex(LL a, LU b) const {
		LL D = 64, x[64], y = 1;
		inc(i, D) { if((b >> i) == 0) { D = i; break; } }
		inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % m; }
		inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= m; } }
		return y;
	}
	pair<LL, LL> ex_gcd(LL a, LL b) const {
		if(b == 0) { return MP(1, 0); }
		auto p = ex_gcd(b, a % b);
		return MP(p.SE, p.FI - (a / b) * p.SE);
	}
};
template<int N> LL ModInt<N>::m;
template<int N> ModInt<N> operator+(LL a, const ModInt<N> & b) { return  b + a; }
template<int N> ModInt<N> operator-(LL a, const ModInt<N> & b) { return -b + a; }
template<int N> ModInt<N> operator*(LL a, const ModInt<N> & b) { return  b * a; }
template<int N> ModInt<N> operator/(LL a, const ModInt<N> & b) { return  a * b.inv(); }
template<int N> istream & operator>>(istream & is, ModInt<N> & b) { LL v; is >> v; b.setval(v); return is; }
template<int N> ostream & operator<<(ostream & os, const ModInt<N> & b) { return (os << b.getval()); }

// ---- ----

template<typename T, int N> struct Matrix {
	vector<vector<T>> a;
	Matrix(const vector<vector<T>> & v = { }) { init(v); }
	void init(const vector<vector<T>> & v) {
		a = vector<vector<T>>(N, vector<T>(N, 0));
		assert(v.size() <= N);
		inc(i, v.size()) { assert(v[i].size() <= N);
		inc(j, v[i].size()) {
			a[i][j] = v[i][j];
		}
		}
	}
	vector<T> & operator[](int i) { return a[i]; }
	Matrix id() {
		Matrix e;
		inc(i, N) { e[i][i] = 1; }
		return e;
	}
	Matrix tp() {
		Matrix b;
		inc(i, N) {
		inc(j, N) {
			b[j][i] = a[i][j];
		}
		}
		return b;
	}
	Matrix & operator+=(const Matrix & b) {
		inc(i, N) {
		inc(j, N) {
			a[i][j] += b.a[i][j];
		}
		}
		return (*this);
	}
	Matrix & operator*=(T b) {
		inc(i, N) {
		inc(j, N) {
			a[i][j] *= b;
		}
		}
		return (*this);
	}
	Matrix & operator*=(const Matrix & b) {
		Matrix c;
		inc(i, N) {
		inc(j, N) {
		inc(k, N) {
			c[i][j] += a[i][k] * b.a[k][j];
		}
		}
		}
		return (*this) = c;
	}
	Matrix & operator^=(LU b) {
		Matrix t[64], c = id();
		int D = 64;
		inc(i, D) { if((b >> i) == 0) { D = i; break; } }
		inc(i, D) { t[i] = (i == 0 ? (*this) : t[i - 1] * t[i - 1]); }
		inc(i, D) { if((b >> i) & 1) { c *= t[i]; } }
		return (*this) = c;
	}
	Matrix operator+(const Matrix & b) const { Matrix c = a; return c += b; }
	Matrix operator*(             T b) const { Matrix c = a; return c *= b; }
	Matrix operator*(const Matrix & b) const { Matrix c = a; return c *= b; }
	Matrix operator^(            LU b) const { Matrix c = a; return c ^= b; }
};
template<typename T, int N> Matrix<T, N> operator*(T a, const Matrix<T, N> & b) { return b * a; }
template<typename T, int N> ostream & operator<<(ostream & os, const Matrix<T, N> & m) {
	inc(i, N) {
	inc(j, N) {
		os << m.a[i][j] << " ";
	} os << endl;
	}
	return os;
}

// ---- ----

typedef ModInt<> MI;

LL n, a, b, m, p[20], e[19];

int main() {
	cin >> n >> a >> b >> m;
	
	LL v = 1;
	inc1(i, 18) {
		p[i] = (v < a ? 0 : ce(v - a, b));
		setmin(p[i], n);
		v *= 10;
	}
	p[19] = n;
	inc1(i, 18) { e[i] = p[i + 1] - p[i]; }
	
	MI::setmod(m);
	MI ans = 0;
	inc1(d, 18) {
		LL c = 0;
		incII(j, d + 1, 18) { c += j * e[j]; }
		
		MI x = MI(10) ^ (d);
		Matrix<MI, 3> A({
			{ 1, 1,  0 }, 
			{ 0, x, -x }, 
			{ 0, 0,  x },
		}), V({
			{ 0 }, 
			{ (a + b * (p[d + 1] - 1)) * (MI(10) ^ c) }, 
			{                        b * (MI(10) ^ c) }
		});
		
		ans += ((A ^ e[d]) * V)[0][0];
	}
	
	cout << ans << endl;
	
	return 0;
}


Measured memory_bytes: 256