#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstring>

#define DLEN 4

using namespace std;

const int MAXN = 5005;
const int MAXM = 2e5 + 5;
const long long mod = 1e9 + 7;

ifstream fin("connectem.in");
ofstream fout("connectem.out");

long long fact[MAXM], invFact[MAXM];

long long fastPow(long long x, long long p)
{
    long long ans = 1, curr = x;
    while(p!=0)
    {
        if(p%2!=0) ans = (ans*curr)%mod;

        curr = (curr*curr)%mod;
        p/=2;
    }

    return ans;
}

long long inv(long long x)
{
    return fastPow(x, mod-2);
}

struct State
{
    int len;
    long long ways;

    State(){}
    State(int len)
    {
        this->len = len;
        this->ways = 1;
    }
    State(int len, long long ways)
    {
        this->len = len;
        this->ways = ways;
    }
};

State operator +(State A, State B)
{
    if(A.len==B.len) return State(A.len, (A.ways+B.ways)%mod);
    if(A.len>B.len) return A;
    if(A.len<B.len) return B;
}

State increment(State A, long long wayChange)
{
    A.len++;
    A.ways = (A.ways * wayChange)%mod;

    return A;
}

int getDist(pair <int, int> a, pair <int, int> b)
{
    int dx = abs(a.first-b.first);
    int dy = abs(a.second-b.second);

    long long ans = fact[dx+dy];
    ans = (ans*invFact[dx])%mod;
    ans = (ans*invFact[dy])%mod;

    return ans;
}


State dp[MAXN];
pair <int, int> a[MAXN];

void solveTestcase()
{
    int n, m, k;
    fin >> n >> m >> k;

    for(int i = 0;i<k;i++) fin >> a[i].first >> a[i].second;
    sort(a, a+k);

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

        int bestLen = 0;
        for(int j = 0;j<i;j++)
            if(a[j].second<=a[i].second && dp[j].len>bestLen) bestLen = dp[j].len;

        for(int j = 0;j<i;j++)
            if(a[j].second<=a[i].second && dp[j].len==bestLen) dp[i] = dp[i] + increment(dp[j], getDist(a[i], a[j]));
    }

    fout << dp[k-1].len << " " << dp[k-1].ways << '\n';
}

int main()
{
    fact[0] = invFact[0] = 1;
    for(int i = 1;i<MAXM;i++)
    {
        fact[i] = (fact[i-1]*1LL*i)%mod;
        invFact[i] = (invFact[i-1]*1LL*inv(i))%mod;
    }

    int T;
    fin >> T;

    while(T--) solveTestcase();
}