#include <iostream>
#include <cmath>
using namespace std;

int findPos(int n) {
    int p = 1;
   for(int i = 1; i++;)
   {
    if(p + 1 >= n)
    return  p  + 1;
    p *= 2;
   }
}
int main() {
    int a, b, n;
    cin >> a >> b >> n;
        cout << a + b<< ' ' << a * (findPos(n)) + b;
        //cout << findPos(n);

        return 0;
}