#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1.0);
void solve() {
  long long n, b, p;
  cin >> n >> b >> p;
  b *= 2;
  b++;
  p *= n;
  long long matches = 0;
  while (n != 1) {
    long long k = 1;
    while (k * 2 <= n) {
      k *= 2;
    }
    matches += k / 2;
    n -= k / 2;
  }
  cout << matches * b << ' ' << p << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
