#include <iostream>
#include <set>
#include <vector>
#include <map>
#include <math.h>
#include <algorithm>
using namespace std;

int a, b;
long long n;

int main()
{
	cin >> a >> b >> n;

	if (n == 2) {
		cout << a + b << " " << 2 * a + b;
		return 0;
	}

	cout << a + b << " ";

	
		long long res = (long long)a*(n - 1LL) + (long long)b;
		int count = 0;
		if (!(n&(n - 1))) {
			count--;
		}
		while (n)
		{
			n >>=1;
			count++;
		}
		count--;
		res = (long long)a*((long long)(1+pow(2,count))) + (long long)b;
		cout << res;
	

    return 0;
}