#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

//using Modint = atcoder::static_modint<998244353>;
using Modint = atcoder::modint;

vector<Modint> conv_circ(int n, const vector<Modint>& a, const vector<Modint>& b){
    vector<Modint> tmp(n*2);
    rep(i,n) rep(j,n) tmp[i+j] += a[i] * b[i];
    rep(i,n) tmp[i] += tmp[i+n];
    return tmp;
}

vector<Modint> sq_circ(int n, const vector<Modint>& a, Modint m){
    vector<Modint> tmp(n*2);
    rep(i,n) rep(j,i) tmp[i+j] += a[i] * a[j];
    rep(i,n*2) tmp[i] += tmp[i];
    rep(i,n) tmp[i*2] += a[i] * a[i];
    rep(i,n) tmp[i] += tmp[i+n] * m;
    return tmp;
}

void add_circ(int n, vector<Modint>& b, Modint m){
    Modint tmp = b[n-1];
    for(int i=n-1; i>=1; i--) b[i] += b[i-1];
    b[0] += tmp * m;
}

vector<Modint> pow_circ(int n, i64 N, Modint m){
    if(N == 0){
        vector<Modint> ans(n);
        ans[0] = 1;
        return ans;
    }
    auto tmp = sq_circ(n, pow_circ(n, N/2, m), m);
    if(N%2 == 1) add_circ(n, tmp, m);
    return tmp;
}

int main(){
    i64 N, M, L, K, B; cin >> N >> M >> L >> K >> B;
    Modint::set_mod(B);
    auto X = pow_circ(L, N, M);
    cout << X[K].val() << endl;
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;