#include <iostream>
#include <cmath>
using namespace std;
int findPos(int n) {
    int i = 0;
    while(1 + pow(2, i) < n)
        i ++;
    return 1 + pow(2, i);
}
int main() {
    int a, b, n;
    cin >> a >> b >> n;
        cout << a + b<< ' ' << a * (findPos(n)) + b;
       // cout << findPos(n);

        return 0;
}