#include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
using pii = pair<int, int>;
const double PI = 2 * asin(1);
int g_n, g_b, g_p;
void pretreat() {}
void input() {}
void solve() {
  g_b = 2 * g_b + 1;
  int cnt = 0, n = g_n;
  while (n > 1) {
    cnt += n / 2;
    if (n & 1) {
      n = n / 2 + 1;
    } else {
      n /= 2;
    }
  }
  printf("%d %d\n", cnt * g_b, g_n * g_p);
}
int main() {
  pretreat();
  while (cin >> g_n >> g_b >> g_p) {
    input();
    solve();
  }
  return 0;
}
