As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC). 

A team is to be formed of n players, all of which are GUC students. However, the team might have players belonging to different departments. There are m departments in GUC, numbered from 1 to m. Herr Wafa's department has number h. For each department i, Herr Wafa knows number si — how many students who play basketball belong to this department.

Herr Wafa was also able to guarantee a spot on the team, using his special powers. But since he hates floating-point numbers, he needs your help at finding the probability that he will have at least one teammate belonging to his department. 

Note that every possible team containing Herr Wafa is equally probable. Consider all the students different from each other.

Input

The first line contains three integers n, m and h (1 ≤ n ≤ 100, 1 ≤ m ≤ 1000, 1 ≤ h ≤ m) — the number of players on the team, the number of departments in GUC and Herr Wafa's department, correspondingly. 

The second line contains a single-space-separated list of m integers si (1 ≤ si ≤ 100), denoting the number of students in the i-th department. Note that sh includes Herr Wafa.

Output

Print the probability that Herr Wafa will have at least one teammate from his department. If there is not enough basketball players in GUC to participate in ABC, print -1. The answer will be accepted if it has absolute or relative error not exceeding 10 - 6.

Examples

Input

3 2 1
2 1


Output

1


Input

3 2 1
1 1


Output

-1


Input

3 2 1
2 2


Output

0.666667

Note

In the first example all 3 players (2 from department 1 and 1 from department 2) must be chosen for the team. Both players from Wafa's departments will be chosen, so he's guaranteed to have a teammate from his department.

In the second example, there are not enough players.

In the third example, there are three possibilities to compose the team containing Herr Wafa. In two of them the other player from Herr Wafa's department is part of the team.

Source: codeforces | Difficulty: MEDIUM_HARD
Tags: Dynamic programming

Combinatorics

Mathematics

Probability


Solutions:
import sys
import math
(n, m, h) = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
total = sum(arr)
if total < n:
	print('-1')
	sys.exit()
total1 = total - arr[h - 1]
rem = total - total1 - 1
total = total - 1
ans = 1
for i in range(n - 1):
	x = float(total1 - i)
	y = float(total - i)
	ans = float(ans * float(x / y))
ans = float(ans)
print('{0:.10f}'.format(round(1 - ans, 10)))


(n, m, h) = map(int, input().split())
M = [int(x) for x in input().split()]
M = [0] + M
tot = sum(M)
if tot < n:
	print(-1)
else:
	tot -= 1
	M[h] -= 1
	ans = 1.0
	others = tot - M[h]
	for i in range(0, n - 1):
		ans *= (others - i) / (tot - i)
	print(1.0 - ans)


(n, m, h) = map(int, input().split())
lis = list(map(int, input().split()))
if sum(lis) < n:
	print(-1)
else:
	s = sum(lis)
	ans = 1
	for i in range(n - 1):
		ans *= s - lis[h - 1] - i
		ans /= s - i - 1
	print(1 - ans)


(n, m, h) = map(int, input().split())
s = list(map(int, input().split()))
a = 1
S = sum(s)
for i in range(S - s[h - 1] + 1, S):
	a *= (i - n + 1) / i
print(-1 if S < n else 1 - a)