///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define PI  (3.1415926535)

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T>
T get_m(M<TT, T> &m, TT k, T default_value)
{
    if (m.find(k) == m.end()) return m[k] = default_value;
    return m[k];
}

template <typename TT, typename T>
void incr_m(M<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(auto &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

void _debug_print(auto x)
{
    cout << x << endl;
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "-- " << x1 << " -- " << x2
         << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename TT, typename T>
void _debug_print(const M<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}

void _debug_print_time(const char *prefix)
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    struct tm *tm = localtime(&tv.tv_sec);
    printf("-- %s %02d:%02d:%02d.%06ld\n",
           prefix, tm->tm_hour, tm->tm_min, tm->tm_sec, tv.tv_usec);
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

ll solve(ll ans, ll b, ll mod, ll digs, ll init, ll len)
{
    debug_printf("------------ solve ans=%lld digs=%lld init=%lld len=%lld\n",
                 ans, digs, init, len);

    ll init_matrix[3][3] = {
        {((ll)pow(10LL, digs)) % mod, 0LL, 0LL},
        {1LL, 1LL, 0LL},
        {0LL, b % mod, 1LL},
    };

    ll pm[64][3][3];
    memcpy(pm[0], init_matrix, sizeof(init_matrix));

    debug_printf("---- pm[0]\n");
    debug_print(pm[0][0], 3);
    debug_print(pm[0][1], 3);
    debug_print(pm[0][2], 3);

    rep (i, 63) rep (j, 3) rep (k, 3) {
        pm[i+1][j][k] = (pm[i][j][0] * pm[i][0][k]) % mod;
        pm[i+1][j][k] %= mod;
        pm[i+1][j][k] += (pm[i][j][1] * pm[i][1][k]) % mod;
        pm[i+1][j][k] %= mod;
        pm[i+1][j][k] += (pm[i][j][2] * pm[i][2][k]) % mod;
        pm[i+1][j][k] %= mod;
    }

    ll result_m[3][3] = {
        {1LL, 0LL, 0LL},
        {0LL, 1LL, 0LL},
        {0LL, 0LL, 1LL},
    };

    ll pos = 0LL;
    while (len) {
        if (len & 1LL) {
            ll rr[3][3];
            rep (j, 3) rep (k, 3) {
                rr[j][k] = (result_m[j][0] * pm[pos][0][k]) % mod;
                rr[j][k] %= mod;
                rr[j][k] += (result_m[j][1] * pm[pos][1][k]) % mod;
                rr[j][k] %= mod;
                rr[j][k] += (result_m[j][2] * pm[pos][2][k]) % mod;
                rr[j][k] %= mod;
            }
            memcpy(result_m, rr, sizeof(result_m));
        }
        len >>= 1LL;
        pos++;
    }

    ll ret = 0;
    ret += (ans * result_m[0][0]) % mod;
    ret %= mod;
    ret += ((init % mod) * result_m[1][0]) % mod;
    ret %= mod;
    ret += (1LL * result_m[2][0]) % mod;
    ret %= mod;

    return ret;
}

void _main()
{
    ll len; llin(len);
    ll a; llin(a);
    ll b; llin(b);
    ll mod; llin(mod);

    ll idxs[20] = {};
    srep (digs, 1, 20) {
        ll left = 0;
        ll right = len - 1LL;
        ll now = (left + right) / 2LL;
        ll border = pow(10LL, digs-1LL);
        idxs[digs] = len;
        for ( ; left <= right; now = (left + right) / 2LL) {
            ll val = a + b * now;
            if (val >= border) {
                idxs[digs] = min(idxs[digs], now);
                right = now - 1LL;
            }
            else {
                left = now + 1LL;
            }
        }
    }

    debug_printf("---- idxs\n");
    debug_print(idxs, 20);

    ll ans = 0;

    srep (digs, 1, 19) {
        ll init = a + b * idxs[digs];
        ll llen = idxs[digs+1] - idxs[digs];
        ans = solve(ans, b, mod, digs, init, llen);
    }

    debug_printf("---- ans\n");
    cout << ans << endl;
}

///////////////////////////////////////////////////////////////////////////////


Measured memory_bytes: 256