#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int INF = 1000 * 1000 * 1000 + 7;
const long long LINF = INF * (long long)INF;
int main() {
  int n, b, p;
  cin >> n >> b >> p;
  int res1 = 0;
  int res2 = n * p;
  while (n != 1) {
    int k = 0;
    while ((1 << k) <= n) k++;
    k--;
    res1 += (1 << k) * b + (1 << (k - 1));
    n -= 1 << (k - 1);
  }
  cout << res1 << " " << res2 << endl;
  return 0;
}
