#include<iostream>
#include<algorithm>

using namespace std ;

const int N = 1010,M = 510;

int n, m , k ;
int f[N][M];

int main()
{
    cin >> n >> m >> k;
    for(int i = 1 ; i<= k ;++ i)
    {
        int a,b;
        cin >> a >> b ;
        for(int j = n ; j >= a ; -- j)
        {
            for(int q = m ; q >= b ;-- q)
            {
                f[j][q] = max(f[j][q],f[j-a][q-b] + 1);
            }
        }
    }
    cout << f[n][m-1] <<" ";
    int t = m - 1;
    while(t >0 && f[n][t-1]==f[n][m-1])t--;
    cout << m - t ;
    return 0;
}