

Colorful ToyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 885 Accepted Submission(s): 365 Problem Description A toy is made up of N vertices and M undirected edges in the 2D plane. As usual, you want to know how many ways there are to color the vertices of the toy. You have totally C colors. And of course, to make things fun, you think that if one color configuration can be rotated to get another, these two configurations should be considered the same. Rotation means 2D inplane rotation and reflection is not considered as rotation. For instance, consider coloring the following toy with 2 colors. The coordinates of the vertices are: 1. (0,0) 2. (1,0) 3. (0,1) 4. (1,0) 5. (0,1) The toy has 6 edges: (1,2), (1,3), (2,3), (3,4), (4,5), (5,2). As a 2D being, this toy has no symmetry. So there are 32 ways to color it. Had the first two edges been removed, there would be only 12 different ways. You should output the answer modulo 10^{9} + 7. Input The first line contains an integer T (T ¡Ü 20) denoting the number of the test cases. Each test case begins with three positive integers N (1 ¡Ü N ¡Ü 50), M (0 ¡Ü M ¡Ü N (N  1)/2) and C(1 ¡Ü C ¡Ü 100). Then follow N lines. Each line contains 2 integers in range [10000,10000] describing a vertex. Then follow M lines. Each line contains 2 integers in range [1,N] representing an edge. There are neither duplicate edges nor selfloops. Output For each test case, output one line containing the answer. Sample Input
Sample Output
Source  
