#include <cassert>
#include <fstream>
#include <cstring>
#include <queue>
#include <algorithm>
#include <bitset>
#include <ctime>
#include <set>
#include <cmath>
#include <unordered_map>
#include <iomanip>
#include <map>
#include <stack>
#include <vector>
#include <bitset>
#include <functional>
#include <iostream>

using namespace std;

#define FOR(i, a, n) for (int i = a; i <= n; ++i)
#define FORN(a, n) for (int i = a; i < n; ++i)
#define ROF(i, n, a) for (int i = n; i >= a; i--)
#define ROFN(n, a) for (int i = n - 1; i >= a; i--)
#define FIT(i, v) for (auto &i : v)
#define pb push_back
#define mp make_pair
#define mt make_touple
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define log log2

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const long long mod = 1000000007;
ll powmod(ll a, ll b) { ll res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; }

long long a, b, n;

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);

	cin >> a >> b >> n;

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

	if (n & 1) {
		cout << (long long)(a + b) << ' ' << (long long)(a * n + b);
	}
	else {
		cout << (long long)(a + b) << ' ' << (long long)(a*(n - 1) + b);
	}

	return 0;
}