#include <bits/stdc++.h>
using namespace std;
inline int ksm(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res *= x;
    x *= x;
    y >>= 1;
  }
  return res;
}
int main() {
  int n, b, p;
  scanf("%d%d%d", &n, &b, &p);
  int shui = 0, maojin = n * p;
  while (n > 1) {
    int k = -1;
    for (int i = 9; i >= 0; i--) {
      if (ksm(2, i) <= n) {
        k = ksm(2, i);
        break;
      }
    }
    shui += b * k + k / 2;
    n -= k / 2;
  }
  printf("%d %d", shui, maojin);
  return 0;
}
