#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define PERM(c)                                                                \
    sort(All(c));                                                              \
    for(bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n)                                                             \
    vector<ll> od(n);                                                          \
    iota(All(od), 0LL);

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
// const double PI = atan(1.0) * 4.0;
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
#define PI 3.141592653589793238

const int MAX_SIZE = 1000010;
class mint {
  public:
    static ll MOD;
    ll x;
    mint() : x(0) {}
    mint(ll x) : x(x % MOD) {}
    mint &fix() {
        x = (x % MOD + MOD) % MOD;
        return *this;
    }
    mint operator-() const { return mint(0) - *this; }
    mint &operator+=(const mint &a) {
        if((x += a.x) >= MOD) {
            x -= MOD;
        }
        return *this;
    }
    mint &operator-=(const mint &a) { return *this += -a; }
    mint &operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint &operator/=(const mint &a) { return (*this *= power(MOD - 2)); }
    mint operator+(const mint &a) const { return mint(*this) += a; }
    mint operator-(const mint &a) const { return mint(*this) -= a; }
    mint operator*(const mint &a) const { return mint(*this) *= a; }
    mint operator/(const mint &a) const { return mint(*this) /= a; }
    bool operator<(const mint &a) const { return x < a.x; }
    bool operator==(const mint &a) const { return x == a.x; }
    const mint power(ll N) {
        if(N == 0) {
            return 1;
        } else if(N % 2 == 1) {
            return *this * power(N - 1);
        } else {
            mint half = power(N / 2);
            return half * half;
        }
    }
};
ll mint::MOD = 1e9 + 7;
istream &operator>>(istream &stream, mint &a) { return stream >> a.x; }
ostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }
mint inv[MAX_SIZE];
mint fact[MAX_SIZE];
mint factinv[MAX_SIZE];
void init() {
    inv[1] = 1;
    for(int i = 2; i < MAX_SIZE; i++) {
        inv[i] = (-inv[mint::MOD % i]) * (mint::MOD / i);
    }
    fact[0] = factinv[0] = 1;
    for(int i = 1; i < MAX_SIZE; i++) {
        fact[i] = mint(i) * fact[i - 1];
        factinv[i] = inv[i] * factinv[i - 1];
    }
}
mint choose(int n, int k) {
    if(n >= 0 && k >= 0 && n - k >= 0) {
        return fact[n] * factinv[k] * factinv[n - k];
    }
    return 0;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }

template <class T>
std::vector<T> kitamasa(const vector<T> &c, const vector<T> &u,
                        const vector<T> &v) {
    size_t k = c.size();
    std::vector<T> r(2 * k - 1);
    for(int i = 0; i < k; i++)
        for(int j = 0; j < k; j++) r[i + j] ^= u[i] & v[j];
    for(int i = 2 * k - 2; i >= k; i--)
        for(int j = 0; j < k; j++) r[i - k + j] ^= r[i] & c[j];
    r.resize(k);
    return r;
}

using vec = vector<mint>;
using mat = vector<vec>;

mat matmul(const mat &A, const mat &B) {
    mat ret(A.size(), vec(B[0].size()));
    REP(i, A.size()) REP(j, B[0].size()) REP(k, B.size()) {
        ret[i][j] += A[i][k] * B[k][j];
    }
    return ret;
}

mat matpow(mat A, ll n) {
    mat ret(A.size(), vec(A.size()));
    REP(i, A.size()) ret[i][i] = 1;
    while(n) {
        if(n & 1) ret = matmul(ret, A);
        A = matmul(A, A);
        n >>= 1;
    }
    return ret;
}

ll mypow(ll x, ll n) {
    ll res = 1;
    while(n > 0) {
        if(n & 1) res = res * x;
        x *= x;
        n >>= 1;
    }
    return res;
}

signed main() {
    LCIN(L, A, B, M);
    mint::MOD = M;
    auto f = [&](ll idx) {
        ll val = A + B * idx;
        return to_string(val).length();
    };
    mat now(3, vec(1));
    now[0][0] = 0;
    now[1][0] = A;
    now[2][0] = 1;
    ll cnt = 0;
    mat Mat(3, vec(3));
    Mat[0][1] = 1;
    Mat[1][1] = 1;
    Mat[1][2] = B;
    Mat[2][2] = 1;
    FOR(d, 1, 19) {
        ll lb = cnt - 1, ub = L;
        while(ub - lb > 1) {
            ll mid = (ub + lb) / 2;
            if(f(mid) <= d)
                lb = mid;
            else
                ub = mid;
        }
        Mat[0][0] = mypow(10, d);
        now = matmul(matpow(Mat, ub - cnt), now);
        cnt = ub;
    }
    cout << now[0][0] << "\n";
}


Measured memory_bytes: 23680