#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 1'000'000'007;
const int N = 30;

void updAdd(int& x, int val)
{
	x += val;
	if (x >= mod)
		x -= mod;
}

int mult(int a, int b)
{
	return (LL)a * b % mod;
}

int g[N];

bool containsBit(int mask, int i)
{
	return (mask >> i) & 1;
}

VI calcDPOneHalf(int l, int r)
{
	int k = r - l;
	VI dp(1 << k);
	dp[0] = 1;
	FOR(i, 0, k)
	{
		FOR(mask, 0, 1 << k)
		{
			if (containsBit(mask, i))
				continue;
			FOR(j, i + 1, k)
			{
				if (containsBit(g[i + l], j + l) && !containsBit(mask, j))
				{
					updAdd(dp[mask | (1 << i) | (1 << j)], dp[mask]);
				}
			}
		}
	}
	return dp;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	FOR(i, 0, m)
	{
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		g[u] |= 1 << v;
		g[v] |= 1 << u;
	}
	int l = min(19, n), r = n - l;
	VI dpL = calcDPOneHalf(0, l), dpR = calcDPOneHalf(l, n);
	reverse(ALL(dpL));
	reverse(ALL(dpR));
	vector<VI> masks(r + 1);
	VI maskIdx(1 << l, -1);
	FOR(mask, 0, 1 << l)
	{
		int pc = __builtin_popcount(mask);
		if (pc <= r)
		{
			maskIdx[mask] = SZ(masks[pc]);
			masks[pc].PB(mask);
		}
	}
	vector<VI> dp = {{1}};
	int ans = mult(dpL[0], dpR[0]);
	FOR(i, 1, r + 1)
	{
		int cntR = 0;
		for (int mask : masks[i])
			if (mask < (1 << r))
				cntR++;
		vector ndp(cntR, VI(SZ(masks[i])));
		FOR(j, 0, cntR)
		{
			int maskR = masks[i][j];
			FOR(k, 0, SZ(masks[i]))
			{
				int maskL = masks[i][k];
				int bitL = 31 - __builtin_clz(maskL);
				int nmaskLIdx = maskIdx[maskL ^ (1 << bitL)];
				FOR(bitR, 0, r)
				{
					if (containsBit(maskR, bitR))
					{
						updAdd(ndp[j][k],
							dp[maskIdx[maskR ^ (1 << bitR)]][nmaskLIdx]);
					}
				}
				updAdd(ans, mult(ndp[j][k], mult(dpL[maskL], dpR[maskR])));
			}
		}
		dp = ndp;
	}
	cout << ans << "\n";
	cerr << (db)clock() / CLOCKS_PER_SEC << endl;
	return 0;
}