#include <bits/stdc++.h>
using namespace std;
template <typename T>
T max(T &a, T &b) {
  return (!(a < b) ? a : b);
}
template <typename T>
T min(T &a, T &b) {
  return (a < b ? a : b);
}
template <typename T>
T mod(T a, T b) {
  return (a < b ? a : a % b);
}
long long mulmod(long long a, long long b, long long m) {
  long long q = (long long)(((long double)a * (long double)b) / (long double)m);
  long long r = a * b - q * m;
  if (r > m) r %= m;
  if (r < 0) r += m;
  return r;
}
template <typename T>
T expo(T e, T n) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = x * p;
    p = p * p;
    n >>= 1;
  }
  return x;
}
template <typename T>
T power(T e, T n, T m) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = mod(x * p, m);
    p = mod(p * p, m);
    n >>= 1;
  }
  return x;
}
template <typename T>
T InverseEuler(T a, T m) {
  return (a == 1 ? 1 : power(a, m - 2, m));
}
template <typename T>
T gcd(T a, T b) {
  return (!b) ? a : __gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return (a * (b / gcd(a, b)));
}
template <typename T>
T bitpop(T x) {
  return __builtin_popcount(x);
}
long long n, b, p, n1, n2, tow, k = 0, bt;
long long facto2, facto1;
long long fact[1237LL + 1];
void pre() {}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin >> n;
  cin >> b;
  cin >> p;
  tow = p * n;
  bt = 0;
  n1 = n;
  n2 = n;
  while (n1 != 1) {
    k = 0;
    do {
      n2 = n2 >> 1;
      ++k;
    } while (n2 != 1);
    bt += (2 * b + 1) * (1 << (k - 1));
    n2 = n1 % (1 << k);
    n1 = expo(2LL, (k - 1)) + n2;
    n2 = n1;
  }
  cout << bt << ' ' << tow;
}
