#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1007 ;
const int LOG = 23 ;
const int MOD = 1e9 + 7 ;

int n , m ;
vector < int > v[ MAXN ] ;
int deg[ MAXN ] ;
pii srt[ MAXN ] ;
int ord[ MAXN ] ;
int adj[ MAXN ][ MAXN ] ;

int lval[ LOG ] , rval[ LOG ] ;
int hh[ ( 1 << LOG ) ] , dp[ ( 1 << LOG ) ] , val[ ( 1 << LOG ) ] ;
int lw[ ( 1 << LOG ) ] ;

void solve ( ) {
    cin >> n >> m ;
    for ( int i = 1 , x , y ; i <= m ; ++ i ) {
        cin >> x >> y ;
        adj[ x ][ y ] = adj[ y ][ x ] = 1 ;
        v[ x ].push_back ( y ) ;
        v[ y ].push_back ( x ) ;
        ++ deg[ x ] , ++ deg[ y ] ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        srt[ i ] = { deg[ i ] , i } ;
    }
    sort ( srt + 1 , srt + n + 1 ) ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        ord[ srt[ i ].se ] = i ;
    }
    for ( int i = 1 ; i < ( 1 << LOG ) ; ++ i ) {
        while ( ( i & ( 1 << lw[ i ] ) ) == 0 ) { ++ lw[ i ] ; }
    }
    ll ans = 0 ;
    for ( int x = 1 ; x <= n ; ++ x ) {
        vector < int > aux[ 2 ] ;
        int wh = 0 ;
        for ( auto y : v[ x ] ) {
            if ( ord[ x ] > ord[ y ] ) { continue ; }
            aux[ wh ].push_back ( y ) ;
            wh ^= 1 ;
        }
        int szl = aux[ 0 ].size ( ) ;
        int szr = aux[ 1 ].size ( ) ;
        for ( int i = 0 ; i < szr ; ++ i ) {
            rval[ i ] = 0 ;
            for ( int j = 0 ; j < szr ; ++ j ) {
                if ( adj[ aux[ 1 ][ i ] ][ aux[ 1 ][ j ] ] == 1 ) {
                    rval[ i ] += ( 1 << j ) ;
                }
            }
        }
        for ( int i = 0 ; i < ( 1 << szr ) ; ++ i ) {
            dp[ i ] = 0 ;
        }
        dp[ 0 ] = 1 ;
        for ( int i = 1 ; i < ( 1 << szr ) ; ++ i ) {
            int j = lw[ i ] , lft = i - ( 1 << lw[ i ] ) ;
            if ( ( rval[ j ] & lft ) == lft && dp[ lft ] == 1 ) { dp[ i ] = 1 ; }
        }
        for ( int i = 0 ; i < szr ; ++ i ) {
            for ( int j = 0 ; j < ( 1 << szr ) ; ++ j ) {
                if ( ( j & ( 1 << i ) ) == 1 ) {
                    dp[ j ] = ( dp[ j ] + dp[ j ^ ( 1 << i ) ] ) % MOD ;
                }
            }
        }
        for ( int i = 0 ; i < szl ; ++ i ) {
            rval[ i ] = 0 ;
            for ( int j = 0 ; j < szr ; ++ j ) {
                if ( adj[ aux[ 0 ][ i ] ][ aux[ 1 ][ j ] ] == 1 ) {
                    rval[ i ] += ( 1 << j ) ;
                }
            }
            lval[ i ] = 0 ;
            for ( int j = 0 ; j < szl ; ++ j ) {
                if ( adj[ aux[ 0 ][ i ] ][ aux[ 0 ][ j ] ] == 1 ) {
                    lval[ i ] += ( 1 << j ) ;
                }
            }
        }
        for ( int i = 0 ; i < ( 1 << szl ) ; ++ i ) {
            hh[ i ] = val[ i ] = 0 ;
        }
        hh[ 0 ] = 1 ;
        val[ 0 ] = ( 1 << szr ) - 1 ;
        for ( int i = 1 ; i < ( 1 << szl ) ; ++ i ) {
            int j = lw[ i ] , lft = i - ( 1 << lw[ i ] ) ;
            val[ i ] = ( val[ lft ] & rval[ j ] ) ;
            if ( ( lval[ j ] & lft ) == lft && hh[ lft ] == 1 ) { hh[ i ] = 1 ; }
        }
        for ( int i = 0 ; i < ( 1 << szl ) ; ++ i ) {
            if ( hh[ i ] == 1 ) {
                ans = ( ans + dp[ val[ i ] ] ) % MOD ;
            }
        }
    }
    cout << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}