Address
Solution
Code
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
namespace inout
{
const int S = 1 << 20;
char frd[S], *ihed = frd + S;
const char *ital = ihed;
inline char inChar()
{
if (ihed == ital)
fread(frd, 1, S, stdin), ihed = frd;
return *ihed++;
}
inline int get()
{
char ch; int res = 0; bool flag = false;
while (!isdigit(ch = inChar()) && ch != '-');
(ch == '-' ? flag = true : res = ch ^ 48);
while (isdigit(ch = inChar()))
res = res * 10 + ch - 48;
return flag ? -res : res;
}
};
using namespace inout;
typedef long long ll;
const int N = 305;
int f[N][N], sum[N], c[N][N];
int n, m, T, Mod, x;
int main()
{
T = get();
while (T--)
{
memset(sum, 0, sizeof(sum));
memset(f, 0, sizeof(f));
n = get(); m = get(); Mod = get();
for (int i = 1; i <= m; ++i)
x = get(), ++sum[get()];
bool flag = false;
for (int i = n; i; --i)
{
sum[i] += sum[i + 1];
if (sum[i] > n - i + 1)
{
flag = true;
break;
}
}
if (flag)
{
puts("NO");
continue;
}
for (int i = 0; i <= n; ++i) c[i][0] = 1;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= i; ++j)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % Mod;
f[n + 1][0] = 1;
for (int i = n; i; --i)
for (int j = 0, jm = n - sum[i] - i + 1; j <= jm; ++j)
for (int k = 0; k <= j; ++k)
f[i][j] = ((ll)f[i][j] + (ll)f[i + 1][j - k] * c[j][k]) % Mod;
printf("YES %d\n", f[1][n - m]);
}
return 0;
}