#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, b, p, sum = 0, a, pow_[30], i;
  pow_[0] = 1;
  for (i = 1; i < 30; i++) {
    pow_[i] = pow_[i - 1] * 2;
  }
  scanf("%lld", &n);
  scanf("%lld", &b);
  scanf("%lld", &p);
  long long ans = n * p;
  while (n > 1) {
    a = log2(n);
    sum += b * (pow_[a]) + pow_[a] / 2;
    n = n - pow_[a] / 2;
  }
  printf("%lld", sum);
  printf(" %lld", ans);
  return 0;
}
