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

using namespace std;

const int MAXM = 1000;
const int MAXN = 1000;
const int MAXP = 1000;

int m;
int n;
int p;
int s[MAXM][MAXN];
int ris[MAXM][MAXN];

void printS() {
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            cout << s[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;
}
void printRis() {
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            cout << ris[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;
}

void spread(int x, int y, int i){

//    cout << "spread di " << x << "," << y << "," << i << endl;

    if (x<0||x>m-1||y<0||y>n-1) {
//        cout << "indice " << x << "," << y << " fuori dai limiti!" << endl;
//        cout << m << " " << n << endl;
        return;
    }

    if (s[x][y]==1){
        if (ris[x][y]==-1) {
//            cout << "pongo n=" << i << " e spread ai vicini" << endl;
            ris[x][y]=i;
            spread(x-1,y,i);
            spread(x+1,y,i);
            spread(x,y-1,i);
            spread(x,y+1,i);
        }
        else if (ris[x][y]==0 || ris[x][y]==i) {
//            cout << "ris=0 oppure ris=i" << endl;
            return;
        }
        else { // FUSIONE!
//            cout << "fuuu sioooo neeee!!" << endl;
            ris[x][y]=i;
            spread(x-1,y,i);
            spread(x+1,y,i);
            spread(x,y-1,i);
            spread(x,y+1,i);
        }
    }
    else {
//        cout << "pongo 0" << endl;
        ris[x][y]=0;
    }
}

int fx = 0;
int fy = 0;
int stop = 0;

void setNextIndex() {
    while (!stop && ris[fx][fy]!=-1) {
        fy++;
//        cout << fy << endl;
        if (fy==n) {
//            cout << "vale n!"<<endl;
            fy=0;
            fx++;
            if (fx==m) stop=1;
        }
    }
//    cout << "nextIndex: " << fx << "," << fy << endl;
}

int checkRis(int k) {
//    cout << "k="<< k << endl;
    int r[k+1];
    memset(r,0,sizeof(r));
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            r[ris[i][j]]++;
        }
    }
    int count = 0;
    for (int i = 1; i <= k; i++) {
        if (r[i]>0) count++;
//        cout << i << ": " << r[i] << endl;
    }
    return count;
}

int solve() {
    memset(ris,-1,sizeof(ris));
    int k=1;
    fx=0;
    fy=0;
    stop=0;
    while (!stop) {
        spread(fx,fy,k);
//        printRis();
        k++;
        setNextIndex();
    }
    return checkRis(k);
}

int checkCrit() {
    int confronto = solve();
    int countCrit=0;
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            if (s[i][j]==1) {
                s[i][j]=0;
                if (solve()>confronto) countCrit++;
//                cout << "provo!" << endl;
                s[i][j]=1;
            }
        }
    }
    return countCrit;
}

int main()
{
    ifstream in("input.txt");
    ofstream out("output.txt");
    in >> m;
    in >> n;
    in >> p;
    int x;
    int y;
    for (int i = 0; i < p; i++) {
        in >> x >> y;
        s[x-1][y-1]=1;
    }

//    printS();
//    printRis();

    out << solve() << endl;
    out << checkCrit() << endl;

    return 0;
}