#if __INCLUDE_LEVEL__ == 0

#include <bits/stdc++.h>

using namespace std;

#include __BASE_FILE__

namespace {

using Mint = atcoder::modint;

void solve() {
  int64_t n;
  int64_t m;
  int l;
  int r;
  {
    int b;
    cin >> tie(n, m, l, r, b);
    Mint::set_mod(b * l);
  }
  using Num = vector<Mint>;
  auto mul = [&](const Num& x, const Num& y) -> Num {
    Num z(l);
    for (int i : rep(l)) {
      for (int j : rep(l)) {
        int k = i + j;
        if (l <= k) {
          k -= l;
        }
        z[k] += x[i] * y[j];
      }
    }
    return z;
  };
  auto power = [&](Num a, int64_t n) {
    assert(0 < n);
    for (; ~n & 1; n >>= 1) {
      a = mul(a, a);
    }
    Num ret = a;
    while (n >>= 1) {
      a = mul(a, a);
      if (n & 1) {
        ret = mul(ret, a);
      }
    }
    return ret;
  };
  using L = atcoder::dynamic_modint<0>;
  L::set_mod(l);
  Num ans(l);
  for (int k : rep(l)) {
    Num t(l);
    t[0] = 1;
    t[k] += m;
    t = power(t, n);
    for (int i : rep(l)) {
      ans[L(i - k * r).val()] += t[i];
    }
  }
  auto t = ans[0];
  if (l % 2 == 0) {
    t -= ans[l / 2];
  }
  print(t.val() / l);
}

}  // namespace

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  solve();
}

#else  // __INCLUDE_LEVEL__

#undef assert
#define assert(expr) (expr) || (__builtin_unreachable(), 0)

#include <atcoder/modint>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = forward<U>(y), true);
}

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts&...>&& t) {
  return is >> t;
}

template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

namespace atcoder {

template <class T, internal::is_modint_t<T>* = nullptr>
istream& operator>>(istream& is, T& x) {
  int v;
  is >> v;
  x = T::raw(v);
  return is;
}

template <class T, internal::is_modint_t<T>* = nullptr>
ostream& operator<<(ostream& os, const T& x) {
  return os << x.val();
}

}  // namespace atcoder

template <class... Ts>
void print(Ts&&... xs) {
  cout << tie(xs...) << '\n';
}

inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

#endif  // __INCLUDE_LEVEL__