#include<bits/stdc++.h> using namespace std; const int N=1e5; const int INF = 0x3f3f3f3f; int n,m,hp; int dp[1010][1010]; int w1[N],w2[N]; int main(){ cin >> m>>hp>>n; for(int i=1;i<=n;i++){ cin >> w1[i] >>w2[i]; } for(int i=1;i<=n;i++){ for(int j = m;j>=w1[i];j--){ for(int k=hp;k>=w2[i];k-- ){ dp[j][k] = max(dp [j][k] , dp[j - w1[i]] [k - w2[i]] +1 ); } } } cout << dp[m][hp]<<" "; int pos=lower_bound(dp[m],dp[m] + hp + 1,dp[m][hp])-dp[m]; cout << hp-pos; return 0; }^^^^^^^^^^