#include <bits/stdc++.h>
using namespace std;
static int N, M;
static int *A, *B;
long long NumberOfMaps (int N, int M, int *A, int *B) {
vector<vector<int>> g(N + 1);
for (int i = 0; i < M; ++i) {
g[max(A[i], B[i])].push_back(min(A[i], B[i]));
}
int res = 0;
vector<int> color(N + 1, 0);
function<void(int)> backtrack = [&](int i) {
if (i > N) {
// for (int i = 1; i <= N; ++i) cerr << color[i] << " \n"[i == N];
++res;
return;
}
array<bool, 4> used = {false, false, false, false};
for (int x : g[i]) used[color[x] - 1] = true;
for (int j = 1; j <= 4; ++j) {
if (used[j - 1]) continue;
color[i] = j;
backtrack(i + 1);
}
};
backtrack(1);
return res;
}
int main(){
int i, tmp;
tmp = scanf("%d%d", &N, &M);
assert(tmp == 2);
if(M == 0){
A = (int *) calloc(1, sizeof(int));
B = (int *) calloc(1, sizeof(int));
}else {
A = (int *) calloc(M, sizeof(int));
B = (int *) calloc(M, sizeof(int));
for(i = 0; i < M; i++){
tmp = scanf("%d%d", &A[i], &B[i]);
assert(tmp == 2);
}
}
printf("%lld", NumberOfMaps(N, M, A, B) );
return 0;
}
