#include <bits/stdc++.h>
using namespace std;
template <typename X>
inline X abs(const X& a) {
  return a < 0 ? -a : a;
}
template <typename X>
inline X sqr(const X& a) {
  return a * a;
}
long long combine(long long n, int k) {
  long long ans = 1;
  for (int i = 0; i < k; i++) ans = (ans * (n - i)) / (i + 1);
  return ans;
}
long long pw(long long a, long long p) {
  long long ans = 1;
  for (int i = 0; i < p; i++) ans *= a;
  return ans;
}
int toint(string s) {
  int n = 0, k = 1;
  for (int i = (int)s.size() - 1; i >= 0; i--) {
    n += (s[i] - '0') * k;
    k *= 10;
  }
  return n;
}
int main() {
  int k, m, n, p;
  int a = 0, b;
  cin >> n >> k >> p, b = n * p;
  while (n > 1) {
    m = 1;
    while (2 * m <= n) m <<= 1;
    a += m * k + m / 2;
    n = n - m + m / 2;
  }
  cout << a << " " << b << endl;
  return 0;
}
