Problem: 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

Solution (in JAVA):

Solution:
import java.io.*;
import java.math.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * Author: Wavator
 */
public class Main {
    public static void main(String[] args){
        InputStream inputStream = System.in;//new FileInputStream("C:\\Users\\wavator\\Downloads\\test.in");
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    static class Task {
        public void solve(InputReader in, PrintWriter out) {
            int r=in.nextInt(),s=in.nextInt(),p=in.nextInt();
            f [][][] situations=new f[r+1][s+1][p+1];
            
            for(int i=0;i<r+1;i++){
                for(int j=0;j<s+1;j++){
                    for(int k=0;k<p+1;k++){
                        build(situations,i,j,k);
                    }
                }
            }

            out.printf("%.12f %.12f %.12f",(double)situations[r][s][p].r,(double)situations[r][s][p].s,(double)situations[r][s][p].p);

         }
         public void build(f[][][] situations,int r1,int s1,int p1){
            if(r1>0&&s1>0&&p1>0){
                int n=r1*s1+r1*p1+s1*p1;
                situations[r1][s1][p1]=new f((r1*p1*situations[r1-1][s1][p1].r+r1*s1*situations[r1][s1-1][p1].r+s1*p1*situations[r1][s1][p1-1].r)/n,(r1*p1*situations[r1-1][s1][p1].s+s1*r1*situations[r1][s1-1][p1].s+s1*p1*situations[r1][s1][p1-1].s)/n,(r1*p1*situations[r1-1][s1][p1].p+s1*r1*situations[r1][s1-1][p1].p+s1*p1*situations[r1][s1][p1-1].p)/n);
            }
            else{
                if(r1==0){
                    if(s1==0){
                        // 0 0 p
                        situations[r1][s1][p1]=new f(0,0,1);
                        // 000 
                    }
                    else{
                         //0 s p
                            situations[r1][s1][p1]=new f(0,1,0);
                    }
                }
                else{
                    if(s1==0){
                        if(p1==0){
//                            r 0 0
                            situations[r1][s1][p1]=new f(1,0,0);
                        }
                        else{
                            //r 0 p
                            situations[r1][s1][p1]=new f(0,0,1);
                        }
                    }
                    else{
                        // r s 0
                            situations[r1][s1][p1]=new f(1,0,0);

                    }
                }
            }
         }
    }

    static class f{
        double r,s,p;
        public f(double r, double s, double p){
            this.r=r;
            this.s=s;
            this.p=p;
        }
    }


    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

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

        public char[] nextCharArray() {
            return next().toCharArray();
        }

        public boolean hasNext() {
            try {
                String string = reader.readLine();
                if (string == null) {
                    return false;
                }
                tokenizer = new StringTokenizer(string);
                return tokenizer.hasMoreTokens();
            } catch(IOException e) {
                return false;
            }
        }
        public BigInteger nextBigInteger() {
            return new BigInteger(next());
        }

        public BigDecimal nextBigDecinal() {
            return new BigDecimal(next());
        }
    }
}