// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// stream
//#include <istream>
#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
#define OUT(dist) std::cout<<(dist);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t:" << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << res / (1.0e9) << "s\n"; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream & os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

#define random_shuffle "USE std::shuffle!";

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

int M;

template<class T>
class MatrixMOD {
private:
	std::valarray<std::valarray<T>> mat;
public:
	MatrixMOD(size_t m = 0, size_t n = 0, T init = 0) {
		if (n == 0) n = m;
		mat.resize(m);
		for (size_t i = 0; i < m; ++i) mat[i].resize(n, init);
	}
	MatrixMOD(std::valarray<std::valarray<T>> a) { mat = a; }
	MatrixMOD<T> init(size_t m = 0, size_t n = 0, T init = 0) {
		if (n == 0) n = m;
		mat.resize(m);
		for (size_t i = 0; i < m; ++i) mat[i].resize(n, init);
		return *this;
	}
	std::valarray<T> & operator[](size_t i) { return mat[i]; }
	const std::valarray<T>& operator[](size_t i) const { return mat[i]; }
	MatrixMOD<T>& operator=(const MatrixMOD<T> & r) {
		for (size_t i = 0; i < mat.size(); ++i) mat[i] = r[i];
		return *this;
	}
	MatrixMOD<T> operator+() const { return mat; }
	MatrixMOD<T> operator-() const {
		MatrixMOD<T> res(mat.size());
		for (size_t i = 0; i < mat.size(); ++i) res[i] = (MOD - mat[i]) %= MOD;
		return res;
	}
	MatrixMOD<T> & operator+=(const MatrixMOD<T> & r) {
		for (size_t i = 0; i < mat.size(); ++i) (mat[i] += r[i]) %= MOD;
		return *this;
	}
	MatrixMOD<T> & operator+=(const T & x) {
		for (size_t i = 0; i < mat.size(); ++i) (mat[i] += x) %= MOD;
		return *this;
	}
	MatrixMOD<T> & operator-=(const MatrixMOD<T> & r) { return *this += MOD - r; }
	MatrixMOD<T>& operator-=(const T & x) { return *this += MOD - x; }
	MatrixMOD<T>& operator*=(const MatrixMOD<T> & r) { // O(N^3)
		MatrixMOD<T> res(*this);
		for (size_t i = 0; i < mat.size(); ++i) {
			for (size_t j = 0; j < r[0].size(); ++j) {
				res[i][j] = 0;
				for (size_t k = 0; k < mat[0].size(); ++k) {
					(res[i][j] += mat[i][k] * r[k][j] % MOD) %= MOD;
				}
			}
		}
		return *this = res;
	}
	MatrixMOD<T>& operator*=(const T & x) {
		for (size_t i = 0; i < mat.size(); ++i) (mat[i] *= x) %= MOD;
		return *this;
	}
	MatrixMOD<T> & operator%=(const T & mod) {
		for (size_t i = 0; i < mat.size(); ++i) mat[i] %= MOD;
		return *this;
	}
	MatrixMOD<T>& operator^=(ll p) { // O(N^3 logP)
		MatrixMOD<T> res(*this);

		for (size_t i = 0; i < mat.size(); ++i) {
			for (size_t j = 0; j < mat[0].size(); ++j) {
				res[i][j] = i == j;
			}
		}
		while (p) {
			if (p & 1) (res *= (*this)) %= MOD;
			((*this) *= (*this)) %= MOD;
			p >>= 1;
		}
		for (size_t i = 0; i < mat.size(); ++i) mat[i] = res[i];
		return *this;
	}
	MatrixMOD<T> operator+(const MatrixMOD & r) const {
		MatrixMOD<T> res(mat);
		return res += r;
	}
	MatrixMOD<T> operator-(const MatrixMOD & r) const {
		MatrixMOD<T> res(mat);
		return res -= r;
	}
	MatrixMOD<T> operator*(const MatrixMOD & r) const {
		MatrixMOD<T> res(mat);
		return res *= r;
	}
	MatrixMOD<T> operator*(const T & r) const {
		MatrixMOD<T> res(mat);
		return res *= r;
	}
	MatrixMOD<T> operator^(const int& p) const {
		MatrixMOD<T> res(mat);
		return res ^= p;
	}
	MatrixMOD<T> t() const {
		MatrixMOD<T> res(mat[0].size(), mat.size(), 0);
		for (size_t i = 0; i < mat[0].size(); ++i) {
			for (size_t j = 0; j < mat.size(); ++j) {
				res[i][j] = mat[j][i];
			}
		}
		return res;
	}
	static MatrixMOD<T> getUnit(size_t n) {
		MatrixMOD<T> res(n, n, 0);
		for (size_t i = 0; i < n; ++i) res[i][i] = 1;
		return res;
	}
	void show() const {
		for (const auto& r : mat) {
			for (const auto& x : r) {
				std::cerr << x << "\t";
			}
			std::cerr << std::endl;
		}
	}
};

ll powMod(ll n, ll p, ll mod) {
	ll res = 1;
	while (p) {
		if (p & 1) (res *= n) %= mod;
		(n *= n) %= mod;
		p >>= 1;
	}
	return res;
}

int d10[19] = {};

signed main() {
	INIT;

	VAR(int, L, A, B, M_); M = MOD = M_;

	d10[0] = 1;
	REP(i, 18) d10[i + 1] = d10[i] * 10;

	V<PAIR> v(19, PAIR(-1, -1));
	FOR(k, 1, 19) {
		int l = (d10[k - 1] - A + B - 1) / B;
		int r = (d10[k - 0] - A + B - 1) / B - 1;
		if (l < 0) l = 0;
		if (r < 0) continue;
		if (l > L - 1) continue;
		if (r > L - 1) r = L - 1;
		if (l > r) continue;
		v[k] = PAIR(l, r);
	}

	V<int> b(20, -1);
	REP(k, 19) {
		if (v[k].first == -1 || v[k].second == -1) continue;

		int l = (A % M + B % M * (v[k].first % M) % M) % M;
		int sz = v[k].second - v[k].first + 1;
		b[k] = 0;

		MatrixMOD<int> P(3, 3, 0);
		P[0][0] = powMod(10, k, M); P[0][1] = B % M; P[0][2] = A % M;
		P[1][1] = P[1][2] = P[2][2] = 1;
		P ^= sz - 1;
		b[k] = (P[0][0] * l % M + P[0][1] * (v[k].first % M + 1) % M + P[0][2]) % M;
	}

	int sum = 1;
	int ans = 0;
	RREP(k, 19) {
		if (b[k] == -1) continue;
		(ans += sum * b[k] % M) %= M;
		REP(_, k) (sum *= powMod(10, v[k].second - v[k].first + 1, M)) %= M;
	}
	OUT(ans)BR;

	return 0;
}

Measured memory_bytes: 256