#include <cstdio>
#include <vector>
using namespace std;

void solve(vector<int> v) {
	vector<int> w;
	for (int i = 0; i < (int)v.size(); i += 2)
		w.push_back(v[i]);
	if (w.size() == 2) {
		printf("%d\n", w[1]);
	}
	else solve(w);
}

int seq[200];

int caca2(int n) {
	int s = 0;
	int p = 1;
	while (p < n) {
		++s;
		p <<= 1;
	}
	//if (p == n) --s;
	return s - 2;
}

int a, b;

int lst(int i) {
	return a * i + b;
}

int main() {
	seq[0] = 3;
	for (int i = 1; i < 200; ++i)
		seq[i] = seq[i - 1] * 2 - 1;
	int n;
	scanf("%d%d%d", &a, &b, &n);
	if (n == 2)
		printf("%d %d\n", lst(1), lst(2));
	else
		printf("%d %d\n", lst(1), lst(seq[caca2(n)]));
	/*for (int n = 3; n < 50; ++n) {
		vector<int> v;
		for (int i = 1; i <= n; ++i)
			v.push_back(i);
		printf("%2d:     %2d      ", n, seq[caca2(n)]);
		solve(v);
	}*/
	return 0;
}