#include <bits/stdc++.h>

using namespace std;

signed main() {
    int h, w, n; scanf("%d%d%d", &h, &w, &n);
    vector<int> px, py;
    for (int i = 1, x, y; i <= n; ++i) {
        scanf("%d%d", &x, &y);
        px.push_back(x), py.push_back(y);
    }
    sort(px.begin(), px.end()), px.erase(unique(px.begin(), px.end()), px.end());
    sort(py.begin(), py.end()), py.erase(unique(py.begin(), py.end()), py.end());
    int r1 = px.back() - px[0] + 1, r2 = py.back() - py[0] + 1, res2 = 0;
    for (int i = 0; i + 1 < (int)px.size(); ++i) {
        if (h - px[i + 1] + 1 + px[i] < px.back() - px[0] + 1) {
            r1 = h - px[i + 1] + 1 + px[i];
            res2 += min(px[i], h - px[i + 1] + 1);
        }
    }
    for (int i = 0; i + 1 < (int)py.size(); ++i) {
        if (w - py[i + 1] + 1 + py[i] < py.back() - py[0] + 1) {
            r2 = w - py[i + 1] + 1 + py[i];
            res2 += min(py[i], w - py[i + 1] + 1);
        }
    }
    printf("%lld %d\n", 1ll * r1 * r2, res2);
    return 0;
}