{"raw_statement":[{"iden":"problem statement","content":"You are given $N$ items.  \nThe _value_ of the $i$\\-th item $(1 \\leq i \\leq N)$ is $v_i$.  \nYour have to select at least $A$ and at most $B$ of these items.  \nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.  \nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 50$\n*   $1 \\leq A,B \\leq N$\n*   $1 \\leq v_i \\leq 10^{15}$\n*   Each $v_i$ is an integer."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $A$ $B$\n$v_1$\n$v_2$\n...\n$v_N$"},{"iden":"sample input 1","content":"5 2 2\n1 2 3 4 5"},{"iden":"sample output 1","content":"4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain $4.5$.  \nThere is no other way to select items so that the mean of the values will be $4.5$, and thus the second line of the output should contain $1$."},{"iden":"sample input 2","content":"4 2 3\n10 20 10 10"},{"iden":"sample output 2","content":"15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized."},{"iden":"sample input 3","content":"5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996"},{"iden":"sample output 3","content":"1000000000000000.000000\n1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}