Consider a connected undirected graph in which the difference between the number of edges and the number of vertices is at most 50. Please find the determinant of its adjacency matrix modulo 998 244 353.

The first line contains two integers n and m: the number of vertices and edges in the graph (1 ≤ n ≤ 2 · 10⁵, n − 1 ≤ m ≤ n + 50).

The next m lines describe edges of the graph. Each of them contains two integers u and v (1 ≤ u, v ≤ n): the two vertices connected by an edge.

It is guaranteed that the graph does not contain self-loops and multiple edges. It is guaranteed that the graph is connected.

Print a single integer: the determinant of the graph’s adjacency matrix modulo 998 244 353.