영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given an undirected graph that has n nodes and m edges.
We consider subgraphs that have all nodes of the original graph and some of its edges. A subgraph is called Eulerian if each node has even degree.
Your task is to count the number of Eulerian subgraphs modulo 10^9+7.
Input
The first input line has two integers n and m: the number of nodes and edges. The nodes are numbered 1,2,…,n.
After this, there are m lines that describe the edges. Each line has two integers a and b: there is an edge between nodes a and b. There is at most one edge between two nodes, and each edge connects two distinct nodes.
Output
Print the number of Eulerian subgraphs modulo 10^9+7.
Constraints
- 1 ≤ n ≤ 10^5
- 0 ≤ m ≤ 2 · 10^5
- 1 ≤ a,b ≤ n
Example
Explanation: You can either keep or remove all edges, so there are two possible Eulerian subgraphs.
예제
예제 1
4 3 1 2 1 3 2 3
2