B"Alice recently found some cactuses growing near her house! After several months, more and more cactuses appeared and soon they blocked the road. So Alice wants to clear them. A cactus is a connected undirected graph. No edge of this graph lies on more than one simple cycle. Let's call a sequence of different nodes of the graph x_1, x_2, ldots, x_k a simple cycle, if k geq 3 and all pairs of nodes x_1 and x_2 , x_2 and x_3 , ldots , x_{k-1} and x_k , x_k and x_1 are connected with edges. Edges (x_1, x_2) , (x_2, x_3) , ldots , (x_{k-1}, x_k) , (x_k, x_1) lies on this simple cycle. There are so many cactuses, so it seems hard to destroy them. But Alice has magic. When she uses the magic, every node of the cactus will be removed independently with the probability frac{1}{2} . When a node is removed, the edges connected to it are also removed. Now Alice wants to test her magic. She has picked a cactus with n nodes and m edges. Let X[S] (where S is a subset of the removed nodes) be the number of connected components in the remaining graph after removing nodes of set S . Before she uses magic, she wants to know the variance of random variable X , if all nodes of the graph have probability frac{1}{2} to be removed and all n of these events are independent. By the definition the variance is equal to E[(X - E[X])^2] , where E[X] is the expected value of X . Help her and calculate this value by modulo 10^9+7 . Formally, let M = 10^9 + 7 (a prime number). It can be shown that the answer can be expressed as an irreducible fraction frac{p}{q} , where p and q are integers and q not equiv 0 pmod{M} . Output the integer equal to p cdot q^{-1} bmod M . In other words, find such an integer x that 0 <= x < M and x cdot q equiv p pmod{M} . The first line"...