#include <iostream>
#include <vector>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

void solve() {
    int n;
    std::cin >> n;

    auto graph = vec(n, vec(n, false));

    int m;
    std::cin >> m;
    while (m--) {
        int u, v;
        std::cin >> u >> v;
        graph[u][v] = graph[v][u] = true;
    }

    int ans = 0;
    for (int b = 0; b < n * n * n * n; ++b) {
        std::vector<int> vs(4);
        {
            int nb = b;
            for (int i = 0; i < 4; ++i) {
                vs[i] = nb % n;
                nb /= n;
            }
        }

        bool valid = true;
        for (int j = 0; j < 4; ++j) {
            for (int i = 0; i < j; ++i) {
                if (vs[i] == vs[j]) valid = false;
                if (((i - j) % 2 == 0) == (graph[vs[i]][vs[j]])) valid = false;
            }
        }

        if (valid) ++ans;
    }

    std::cout << ans / 8 << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}