A tennis tournament with n participants is running. The participants are playing by an olympic system, so the winners move on and the losers drop out.

The tournament takes place in the following way (below, m is the number of the participants of the current round):

  * let k be the maximal power of the number 2 such that k ≤ m, 
  * k participants compete in the current round and a half of them passes to the next round, the other m - k participants pass to the next round directly, 
  * when only one participant remains, the tournament finishes. 



Each match requires b bottles of water for each participant and one bottle for the judge. Besides p towels are given to each participant for the whole tournament.

Find the number of bottles and towels needed for the tournament.

Note that it's a tennis tournament so in each match two participants compete (one of them will win and the other will lose).

Input

The only line contains three integers n, b, p (1 ≤ n, b, p ≤ 500) — the number of participants and the parameters described in the problem statement.

Output

Print two integers x and y — the number of bottles and towels need for the tournament.

Examples

Input

5 2 3


Output

20 15


Input

8 2 4


Output

35 32

Note

In the first example will be three rounds:

  1. in the first round will be two matches and for each match 5 bottles of water are needed (two for each of the participants and one for the judge), 
  2. in the second round will be only one match, so we need another 5 bottles of water, 
  3. in the third round will also be only one match, so we need another 5 bottles of water. 



So in total we need 20 bottles of water.

In the second example no participant will move on to some round directly.
import java.io.*;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Formatter;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws Exception {
        (new Main()).myCode();
    }
    public void myCode() throws Exception {
        Input(""); Output("");
        splitLine();
        int n = getInt();
        int u = getInt();
        int v = getInt();
        int a = 0;
        int b = n;
        while (n > 1) {
            int m = 1 << ((int) (Math.log(n)/Math.log(2)));
            n -= (m >> 1);
            a += (m >> 1) + m * u;
        }
        output.println(a + " " + (v * b));
        close();
    }
    /*=================================================================================================================*
     * Data IO
     */
    BufferedReader input;
    PrintWriter output;
    StringTokenizer token;
    public void Input (String name) throws Exception {
        if (name != ""){
            input = new BufferedReader(new FileReader(name));
        } else {
            input = new BufferedReader(new InputStreamReader(System.in));
        }
    }
    public void Output (String name) throws Exception {
        if (name != ""){
            output = new PrintWriter(new BufferedWriter(new FileWriter(name)));
        } else {
            output = new PrintWriter(System.out);
        }
    }
    public String getLine () throws Exception {
        return input.readLine();
    }
    public void splitLine () throws Exception {
        token = new StringTokenizer(getLine());
    }
    public long getLong () throws Exception {
        return Long.parseLong(token.nextToken());
    }
    public int getInt () throws Exception {
        return Integer.parseInt(token.nextToken());
    }
    public String getStr () throws Exception {
        return token.nextToken();
    }
    public char getChar () throws Exception {
        return token.nextToken().charAt(0);
    }
    public void close () throws Exception {
        if (input != null) {
            input.close();
        }
        if (output != null) {
            output.close();
        }
    }
    /*================================================================================================================*/
}