import itertools

N = int(input())
cases = list(input().split())
K = int(input())

all_combinations = list(itertools.combinations(cases, K))

valid_combinations = [combo for combo in all_combinations if 'a' in combo]

prob_consist_a = len(valid_combinations) / len(all_combinations)
print(prob_consist_a)