#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, b, p;
  cin >> n >> b >> p;
  int left = n;
  int matches = 0;
  while (left != 1) {
    int k = 1;
    for (int i = 1;; i++) {
      if (pow(2, i) <= left) {
        k = pow(2, i);
      } else
        break;
    }
    int others = left - k;
    matches += k;
    left = k / 2 + others;
  }
  cout << matches * b + matches / 2 << " " << p * n << endl;
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
