显示原始代码
#include <bits/stdc++.h>
using ll = long long;
struct mint {
static int MOD;
int v;
explicit operator int() const { return v; }
mint() { v = 0; }
mint(ll _v) {
v = int((-MOD < _v && _v < MOD) ? _v : _v % MOD);
if (v < 0)
v += MOD;
}
friend bool operator==(const mint& a, const mint& b) { return a.v == b.v; }
friend bool operator!=(const mint& a, const mint& b) { return !(a == b); }
mint& operator+=(const mint& m) {
if ((v += m.v) >= MOD)
v -= MOD;
return *this;
}
mint& operator-=(const mint& m) {
if ((v -= m.v) < 0)
v += MOD;
return *this;
}
mint& operator*=(const mint& m) {
v = int((ll)v * m.v % MOD);
return *this;
}
friend mint pow(mint a, ll p) {
mint ans = 1;
for (; p; p /= 2, a *= a)
if (p & 1)
ans *= a;
return ans;
}
mint operator-() const { return mint(-v); }
friend mint operator+(mint a, const mint& b) { return a += b; }
friend mint operator-(mint a, const mint& b) { return a -= b; }
friend mint operator*(mint a, const mint& b) { return a *= b; }
friend std::ostream& operator<<(std::ostream& os, const mint& a) {
os << a.v;
return os;
}
};
int mint::MOD;
template <typename T>
using V = std::vector<T>;
void solve() {
int n, m;
std::cin >> n >> m >> mint::MOD;
V<V<mint>> dp(2, V<mint>(n + 1, 0));
for (int i = 1; i < n; i++) dp[0][i] = 1;
dp[1][0] = 1;
for (int i = 1; i < m; i++) {
V<V<mint>> ndp(2, V<mint>(n + 1, 0));
for (int j = 1; j < n; j++) {
for (int k = 0; k < 2; k++) {
ndp[k][j] = dp[k][j - 1] + 2 * dp[k][j] + dp[k][j + 1];
}
ndp[1][0] = 2 * dp[1][0] + dp[0][1] + dp[1][1];
}
dp.swap(ndp);
}
mint ans = 0;
for (int i = 0; i < n; i++) ans += dp[1][i];
ans *= 4;
std::cout << ans << '\n';
}
int main() {
std::cin.tie(0)->sync_with_stdio(0);
std::cin.exceptions(std::cin.failbit);
int T;
std::cin >> T;
while (T--) {
solve();
}
return 0;
}