Problem G
Intergalactic Team

The Intergalactic Competitive Programming Contest (ICPC) is coming up, and it’s time to choose a team that will represent our planet in this esteemed competition. The ICPC president has announced the team size for this year’s competition to all planets that want to compete. The Earth ICPC committee needs to form a team that consists of exactly this number of members.

To maximize compatibility and teamwork between team members, a set of people can form a team if for any pair of members $(u,v)$ in the set, $u$ must specify $v$ as someone they want to work with and vice versa. In addition, as part of the competitors’ demand, between any two competitors if either of them specifies that he/she wants to work with the other competitor, then either both of them or neither of them shall be in the team.

Earth has $n$ eligible competitors to participate in this year’s competition. Earth has collected data regarding for every competitor who they want to work with as teammates. With this information available, can you help the Earth ICPC committee determine the number of ways to choose a team of the required size for the upcoming competition? Two team configurations are considered different if there is at least one member that is in one configuration but not in the other.

Input

The first line of input contains three integers $n$, $m$, and $k$ ($1\le n\le {10}^5,1\le m\le min(n\cdot (n-1),{10}^6),1\le k\le n$), where $n$ is the number of prospective competitors, $m$ is the number of entries specifying that which competitors are willing to work with which competitors, and $k$ is the exact team size required for this year’s ICPC.

The competitors are numbered $1$ to $n$. The next $m$ lines each contain two integers $x$ and $y$ ($1\le x,y\le n,x\ne y$), denoting that competitor $x$ wants to work with competitor $y$. It is guaranteed that all those entries are unique.

Output

Output a single integer, the number of ways for the Earth ICPC committee to choose a team for the upcoming ICPC.

7 7 2
1 2
2 3
3 1
4 5
5 4
6 7
7 6

2