#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+42,mod=1e9+7;

int n,m,k;

pair<int,int> inp[nmax];

pair<int,int> dp[nmax];

long long fact[nmax],inv[nmax];

long long my_pow(long long a,int b)
{
    long long ret=1;
    while(b)
    {
        if(b%2)ret=ret*a%mod;
        b=b/2;
        a=a*a%mod;
    }
    return ret;
}
long long C(int p,int q)
{
    long long ret=fact[p];
    ret=ret*inv[q]%mod;
    ret=ret*inv[p-q]%mod;
    return ret;
}

void solve()
{
    scanf("%i%i%i",&n,&m,&k);

    for(int i=1;i<=k;i++)
        scanf("%i%i",&inp[i].first,&inp[i].second);

    sort(inp+1,inp+k+1);

    for(int i=1;i<=k;i++)dp[i]={0,0};

    dp[1]={1,1};

    for(int i=2;i<=k;i++)
        for(int j=1;j<i;j++)
            if(inp[j].first<=inp[i].first&&inp[j].second<=inp[i].second)
            {
                long long ways=C(inp[i].first-inp[j].first+inp[i].second-inp[j].second,inp[i].first-inp[j].first)*dp[j].second%mod;

                pair<int,int> cur={dp[j].first+1,ways};

                if(dp[i].first<cur.first)dp[i]=cur;
                else if(dp[i].first==cur.first)
                {
                    dp[i].second=(dp[i].second+cur.second)%mod;
                }
            }

    printf("%i %i\n",dp[k].first,dp[k].second);
}

long long inv_num[nmax];

int main()
{

    freopen("connectem.in","r",stdin);
    freopen("connectem.out","w",stdout);

    int t;
    scanf("%i",&t);

    fact[0]=1;
    for(int i=1;i<nmax;i++)fact[i]=1LL*i*fact[i-1]%mod;

    inv_num[1] = 1;
    for(int i = 2; i < nmax; ++i)
        inv_num[i] = mod - (mod/i) * inv_num[mod%i] % mod;

    //cout<<inv_num[2]<<" "<<inv_num[3]<<endl;

    inv[0]=1;
    for(int i=1;i<nmax;i++)inv[i]=inv[i-1]*inv_num[i]%mod;

    while(t)
    {
        t--;
        solve();
    }
    return 0;
}