Problem: Dark Assembly is a governing body in the Netherworld. Here sit the senators who take the most important decisions for the player. For example, to expand the range of the shop or to improve certain characteristics of the character the Dark Assembly's approval is needed.

The Dark Assembly consists of n senators. Each of them is characterized by his level and loyalty to the player. The level is a positive integer which reflects a senator's strength. Loyalty is the probability of a positive decision in the voting, which is measured as a percentage with precision of up to 10%. 

Senators make decisions by voting. Each of them makes a positive or negative decision in accordance with their loyalty. If strictly more than half of the senators take a positive decision, the player's proposal is approved. 

If the player's proposal is not approved after the voting, then the player may appeal against the decision of the Dark Assembly. To do that, player needs to kill all the senators that voted against (there's nothing wrong in killing senators, they will resurrect later and will treat the player even worse). The probability that a player will be able to kill a certain group of senators is equal to A / (A + B), where A is the sum of levels of all player's characters and B is the sum of levels of all senators in this group. If the player kills all undesired senators, then his proposal is approved.

Senators are very fond of sweets. They can be bribed by giving them candies. For each received candy a senator increases his loyalty to the player by 10%. It's worth to mention that loyalty cannot exceed 100%. The player can take no more than k sweets to the courtroom. Candies should be given to the senators before the start of voting.

Determine the probability that the Dark Assembly approves the player's proposal if the candies are distributed among the senators in the optimal way.

Input

The first line contains three integers n, k and A (1 ≤ n, k ≤ 8, 1 ≤ A ≤ 9999).

Then n lines follow. The i-th of them contains two numbers — bi and li — the i-th senator's level and his loyalty.

The levels of all senators are integers in range from 1 to 9999 (inclusive). The loyalties of all senators are integers in range from 0 to 100 (inclusive) and all of them are divisible by 10.

Output

Print one real number with precision 10 - 6 — the maximal possible probability that the Dark Assembly approves the player's proposal for the best possible distribution of candies among the senators.

Examples

Input

5 6 100
11 80
14 90
23 70
80 30
153 70


Output

1.0000000000


Input

5 3 100
11 80
14 90
23 70
80 30
153 70


Output

0.9628442962


Input

1 3 20
20 20


Output

0.7500000000

Note

In the first sample the best way of candies' distribution is giving them to first three of the senators. It ensures most of votes.

It the second sample player should give all three candies to the fifth senator.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.Comparator;

public class Main {
	private static StreamTokenizer in;
	private static PrintWriter out;
	static {
		in = new StreamTokenizer(new BufferedReader(new InputStreamReader(
				System.in)));
		out = new PrintWriter(System.out);
	}

	private static int nextInt() throws Exception {
		in.nextToken();
		return (int) in.nval;
	}

	private static double nextDouble() throws Exception {
		in.nextToken();
		return in.nval;
	}

	private static String nextString() throws Exception {
		in.nextToken();
		return in.sval;
	}

	public static void main(String[] args) throws Exception {
		int n = nextInt(), k = nextInt(), A = nextInt(), r = n + k - 1;
		int[][] s = new int[n][];
		for (int i = 0; i < n; i++) {
			s[i] = new int[] { nextInt(), nextInt() };
		}
		double max = 0;
		int[] prb = new int[n];
		for (int u = (1 << r); u >= 0; u--) {
			// проверим на n-1 единичек
			int ones = 0;
			for (int i = 0; i < r; i++) {
				if ((u & (1 << i)) != 0) {
					ones++;
				}
			}
			if (ones != n - 1) {
				continue;
			}
			// проверили. расставляем массив
			ones = 0;
			int p = 0;
			for (int i = 0; i < r; i++) {
				if ((u & (1 << i)) == 0) {
					ones++;
				} else {
					prb[p] = ones * 10;
					p++;
					ones = 0;
				}
			}
			prb[p] = ones * 10;
			p++;
			ones = 0;
			double sum = 0;
			for (int i = 0; i < n; i++) {
				if (prb[i] > 100 - s[i][1])
					prb[i] = 100 - s[i][1];
				s[i][1] = prb[i] + s[i][1];
			}
			for (int i = (1 << n) - 1; i >= 0; i--) {
				double prob = 1;
				int lvl = 0;
				int kill = 0;
				for (int j = 0; j < n; j++) {
					if ((i & (1 << j)) != 0) {
						prob *= s[j][1] / 100.0;
						kill--;
					} else {
						lvl += s[j][0];
						prob *= (1 - s[j][1] / 100.0);
						kill++;
					}
				}
				if (kill >= 0) {
					sum += prob * ((double) A / (A + lvl));
				} else {
					sum += prob;
				}
			}
			for (int i = 0; i < n; i++) {
				s[i][1] = -prb[i] + s[i][1];
			}
			max = Math.max(max, sum);
		}
		out.println(max);
		out.flush();
	}
}