|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
In Byteland there are n cities numbered from 1 to n. These cities are connected by a network of m bidirectional roads. It is known that each pair of cities is connected by at most one road.
Byteman admitted recently that he likes some cities more than others. More precisely, he spends his time especially well in cities with numbers from 1 to k, so during every journey he visits each of them at least once.
Byteman's journey is a sequence of m cities, such that each pair of consecutive cities is connected by a road. The journey can start and end in any city. Your task is to compute the number of distinct journeys around Byteland that Byteman can make. Because this number might be quite large, it will be enough to find it modulo 109 + 9.
Write a program that:
The first line of input contains four integers n, m, k and d (1 ≤ n ≤ 20, 1 ≤ k ≤ min(n, 7), 1 ≤ d ≤ 1 000 000 000), separated by single spaces. The following m lines contain descriptions of connections between cities of Byteland. A description of a road consists of two numbers ai, bi (1 ≤ ai, bi ≤ n, ai ≠ bi), separated by a single space and denoting the numbers of cities connected by the i'th road.
The output should contain one integer, denoting the number of distinct journeys that Byteman can make, modulo 109 + 9.
4 4 2 3 1 2 2 3 3 1 2 4
All possible Byteman's journeys are: