#include <bits/stdc++.h> using namespace std; const int N = 1005; int m , k , n , maxn = -1; int dp[N][N] , a[N] , b[N]; int main() { cin >> m >> k >> n; int ans = k; for(int i = 1;i <= n; i++) cin >> a[i] >> b[i]; for(int i = 1;i <= n;i++) for(int j = m;j >= a[i];j--) for(int p = k;p >= b[i];p--) dp[j][p] = max(dp[j][p] , dp[j - a[i]][p - b[i]] + 1); for(int i = 0;i <= k;i++) if(dp[m][i] > maxn) maxn = dp[m][i] , ans = k - i; cout << maxn << ' ' << ans; return 0; }