The Bad Luck Island is inhabited by three kinds of species: r rocks, s scissors and p papers. At some moments of time two random individuals meet (all pairs of individuals can meet equiprobably), and if they belong to different species, then one individual kills the other one: a rock kills scissors, scissors kill paper, and paper kills a rock. Your task is to determine for each species what is the probability that this species will be the only one to inhabit this island after a long enough period of time.

Input

The single line contains three integers r, s and p (1 ≤ r, s, p ≤ 100) — the original number of individuals in the species of rock, scissors and paper, respectively.

Output

Print three space-separated real numbers: the probabilities, at which the rocks, the scissors and the paper will be the only surviving species, respectively. The answer will be considered correct if the relative or absolute error of each number doesn't exceed 10 - 9.

Examples

Input

2 2 2


Output

0.333333333333 0.333333333333 0.333333333333


Input

2 1 2


Output

0.150000000000 0.300000000000 0.550000000000


Input

1 1 3


Output

0.057142857143 0.657142857143 0.285714285714
import java.io.*;
import java.util.*;
import java.math.*;
 
public class Main {


    double[][][] dp = new double[101][101][101];

    public void solve() throws IOException{


        int r = in.nextInt();
        int s = in.nextInt();
        int p = in.nextInt();

        dp[r][s][p] = 1;        
        for(int i = r; i >= 0; i--){
            for(int j = s; j >= 0; j--){
                for(int k = p; k >= 0; k--){
        
                    double total = i * j + j * k + i * k;
                    if(total == 0) continue;
                    if(i != 0) dp[i - 1][j][k] += dp[i][j][k] * i * k / total;
                    if(j != 0) dp[i][j - 1][k] += dp[i][j][k] * j * i / total;
                    if(k != 0) dp[i][j][k - 1] += dp[i][j][k] * k * j / total;

                }
            }
        }

        
        double a = 0.0;
        double b = 0.0;
        double c = 0.0;

        for(int i = 0; i <= 100; i++){

            if(dp[i][0][0] != -1){
                a += dp[i][0][0];
            }

            if(dp[0][i][0] != -1){
                b += dp[0][i][0];
            }

            if(dp[0][0][i] != -1){
                c += dp[0][0][i];
            }

        }

        out.println( a + " " + b + " " + c);  
    }



    public BigInteger gcdBigInt(BigInteger a, BigInteger b){

        if(a.compareTo(BigInteger.valueOf(0L)) == 0){
            return b;
        }else{
            return gcdBigInt(b.mod(a), a);
        }

    }

 
    FastScanner in;
    PrintWriter out;
 
    static class FastScanner {
 
        BufferedReader br;
        StringTokenizer st;
 
        FastScanner(InputStream in) {
            br = new BufferedReader(new InputStreamReader(in));
            st = null;
        }
 
        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }
 
        String nextLine() throws IOException {
            if (st == null || !st.hasMoreTokens())
                return br.readLine();
            StringBuilder result = new StringBuilder(st.nextToken());
            while (st.hasMoreTokens()) {
                result.append(" ");
                result.append(st.nextToken());
            }
            return result.toString();
        }
 
        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
 
        long nextLong() throws IOException {
            return Long.parseLong(next());
        }
 
        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
 
    }
 
    void run() throws IOException {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out, false);
        solve();
        out.close();
    }
 
    public static void main(String[] args) throws IOException{
        new Main().run();
    }
 
    public void printArr(int[] arr){
        for(int i = 0; i < arr.length; i++){
            out.print(arr[i] + " ");
        }
        out.println();
    }
 
    public long gcd(long a, long b){
        if(a == 0) return b;
        return gcd(b % a, a);
    }

    public boolean isPrime(long num){

        if(num == 0 || num == 1){
            return false;
        }

        for(int i = 2; i * i <= num; i++){
            if(num % i == 0){
                return false;
            }
        }

        return true;
    }

    public class Pair<A, B>{
        public A x; 
        public B y;

        Pair(A x, B y){
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Pair<?, ?> pair = (Pair<?, ?>) o;
            if (!x.equals(pair.x)) return false;
            return y.equals(pair.y);
        }

        @Override
        public int hashCode() {
            int result = x.hashCode();
            result = 31 * result + y.hashCode();
            return result;
        }

    }

    class Tuple{
        int x; int y; int z;
        Tuple(int ix, int iy, int iz){
            x = ix;
            y = iy;
            z = iz;
        }
    }
}
