Milk Pails

#include<bits/stdc++.h>
using namespace std;

void solve(){
    int x,y,m;
    scanf("%d %d %d",&x,&y,&m);


    int ans=0;
    for(int i=0;i*x<=m;i++){
        for(int j=0;j*y<=m-i*x;j++){
            ans = max(ans, (i*x+j*y<=m)?i*x+j*y:0);
        }
    }

    printf("%d\n",ans);
}

int main()
{
    freopen("pails.in", "r", stdin);
    freopen("pails.out", "w", stdout);
    int tc=1;
    //scanf("%d",&tc);

    while(tc--){
        solve();
    }
}