上代码～

#include <bits/stdc++.h>
using namespace std;
typedef int _int;
#define int long long

int n,m,mo,cnt[301],f[301][301];
int yh[301][301];

void pre()
{
    for (int i=0;i<=n;++i) yh[i][0]=1;
    for (int i=1;i<=n;++i) {
        for (int j=1;j<=i;++j) {
            yh[i][j]=yh[i-1][j-1]+yh[i-1][j];
            yh[i][j]%=mo;
        }
    }
}

_int main()
{
    int T;cin>>T;
    while (T--) {
        memset(f,0,sizeof(f));
        memset(cnt,0,sizeof(cnt));
        int x,y,flag=0;
        cin>>n>>m>>mo;
        for (int i=1;i<=m;++i) {
            cin>>x>>y;
            ++cnt[y];
        }
        for (int i=n;i;--i) {
            cnt[i]+=cnt[i+1];
            if (cnt[i]+i>n+1) {flag=1;break;}
        }
        if (flag) {puts("NO");continue;}
        pre();
        f[n+1][0]=1;int i,j,k;
        for (i=n;i;--i)
            for (j=0;j+i+cnt[i]<=n+1;++j)
                for (k=0;k<=j;++k)
                    f[i][j]+=(f[i+1][j-k]*yh[j][k]),f[i][j]%=mo;
        cout<<"YES "<<f[1][n-m]<<endl;
    }
    return 0;
}