#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, b, p;
  cin >> n >> b >> p;
  int m = n;
  long long int nb = 0;
  while (n > 1) {
    for (int i = 8; i >= 0; i--) {
      if (pow(2, i) <= n) {
        nb += b * pow(2, i) + pow(2, i) / 2;
        n = n - (pow(2, i)) + pow(2, i) / 2;
        break;
      }
    }
  }
  cout << nb << " " << m * p;
  return 0;
}
