fn main() {
    input! {
        n: usize,
        m: usize,
        e: [(usize1, usize1); m],
    }
    let mut g = vec![vec![]; n];
    for (a, b) in e {
        g[a].push(b);
        g[b].push(a);
    }
    let mut used = vec![false; n];
    let mut ans = 0;
    let mut id = vec![n; n];
    for _ in 0..n {
        let x = (0..n)
            .filter(|x| !used[*x])
            .min_by_key(|x| g[*x].len())
            .unwrap();
        used[x] = true;
        let neighbor = std::mem::take(&mut g[x]);
        for (i, &v) in neighbor.iter().enumerate() {
            id[v] = i;
        }
        let mut graph = vec![0usize; neighbor.len()];
        for (i, (graph, &v)) in graph.iter_mut().zip(neighbor.iter()).enumerate() {
            g[v].retain(|p| *p != x);
            *graph |= 1 << i;
            for &u in g[v].iter() {
                let k = id[u];
                if k != n {
                    *graph |= 1 << k;
                }
            }
        }
        let m = neighbor.len() / 2;
        let (l, r) = graph.split_at(m);
        let mut and = vec![!0; 1 << r.len()];
        for (i, r) in r.iter().enumerate() {
            and[1 << i] = *r >> m;
        }
        bitwise_transform(&mut and, |a, b| *b &= *a);
        for (i, and) in and.iter_mut().enumerate() {
            if *and & i == i {
                *and = 1;
            } else {
                *and = 0;
            }
        }
        bitwise_transform(&mut and, |a, b| *b += *a);
        let memo = and;
        let mut and = vec![!0; 1 << l.len()];
        for (i, l) in l.iter().enumerate() {
            and[1 << i] = *l;
        }
        bitwise_transform(&mut and, |a, b| *b &= *a);
        for (i, and) in and.iter().enumerate() {
            if *and & i == i {
                ans += memo[*and >> m & (memo.len() - 1)];
            }
        }
        for &v in neighbor.iter() {
            id[v] = n;
        }
    }
    println!("{}", ans);
}

// ---------- begin bitwise transform ----------
pub fn bitwise_transform<T, F>(a: &mut [T], mut f: F)
where
    F: FnMut(&mut T, &mut T),
{
    let n = a.len().trailing_zeros() as usize;
    assert!(a.len() == 1 << n);
    for i in 0..n {
        for a in a.chunks_exact_mut(2 << i) {
            let (x, y) = a.split_at_mut(1 << i);
            for (x, y) in x.iter_mut().zip(y) {
                f(x, y);
            }
        }
    }
}
// ---------- end bitwise transform ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------