#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}


ll mod_pow(ll a, ll n, ll mod) {
    ll ans = 1;
    
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll n, m; int l, k, b; cin >> n >> m >> l >> k >> b;
    mint::set_mod(b);
    vector<mint> ans(l), a(l);
    ans[0] = 1;
    a[0] = 1;
    a[1%l] += 1;
    while (n > 0) {
        if (n&1) {
            vector<mint> nx(l);
            for(int i = 0; i < l; i++){
                for(int j = 0; j < l; j++){
                    if(i+j >= l){
                        nx[(i+j)%l] += ans[i]*a[j]*m;
                    }else{
                        nx[(i+j)%l] += ans[i]*a[j];
                    }
                }
            }
            ans = nx;
        }
        vector<mint> nx(l);
        for(int i = 0; i < l; i++){
            for(int j = 0; j < l; j++){
               if(i+j >= l){
                    nx[(i+j)%l] += a[i]*a[j]*m;
                }else{
                    nx[(i+j)%l] += a[i]*a[j];
                }
            }
        }
        a = nx;
        n >>= 1;
    }
    cout << ans[k] << endl;
}