#include <bits/stdc++.h>
using namespace std;
int N, B, P;
int pw2[20];
void init() {
  pw2[0] = 1;
  for (int i = 1; i <= 10; i++) pw2[i] = pw2[i - 1] * 2;
}
int rev(int n) {
  for (int i = 10; i >= 1; i--)
    if (pw2[i] <= N) return pw2[i];
}
int solve() {
  int ret = 0;
  while (N > 1) {
    int k = rev(N);
    ret += (k * B + k / 2);
    N = k / 2 + (N - k);
  }
  return ret;
}
int main() {
  init();
  scanf("%d%d%d", &N, &B, &P);
  int y = N * P;
  int x = solve();
  printf("%d %d\n", x, y);
  return 0;
}
