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.util.*;
import java.io.*;
public class a {
    public static PrintWriter out;
    public static void main(String[] args) throws IOException {
        FS sc = new FS(System.in);
        out = new PrintWriter(new BufferedOutputStream(System.out));
        
        int n = sc.nextInt();
        int b = sc.nextInt();
        int p = sc.nextInt();
        int ans = 0;
        int m = n;
        while (m > 1) {
            int k = 1;
            while (k*2 <= m) {
                k *= 2;
            }
            ans += (k/2)*((2*b)+1);
            m -= k/2;
            //out.println(ans);
        }
        out.println(ans + " " + (n*p));
        out.close();
    }
    
    static class FS {
    	BufferedReader br;
        StringTokenizer st;

    	public FS(InputStream i) {
            br = new BufferedReader(new InputStreamReader(i));
	        st = new StringTokenizer("");
        }

        public String next() throws IOException {
            if(st.hasMoreTokens())
                return st.nextToken();
    	    else
                st = new StringTokenizer(br.readLine());
            return next();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
	
        public long nextLong() throws IOException {
            return Long.parseLong(next());
    	}

        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
    }
}
