#include<fstream>
#include<set>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("count.in");
ofstream fout("count.out");
int g[30005], f[30005], v[6], x[6], nr, sol[5], n, m, a, b;
set<int> List[30005];
queue<int> q;
void solve(){
    int k = 0;
    for( int i = 1; i <= (1<<nr); i++ ){
        k = 0;
        for( int j = 0; j < nr; j++ ){
            if( ( (i>>j) & 1 ) == 1 ){
                x[++k] = v[j + 1];
            }
        }
        int ok = 1;
        for( int i1 = 1; i1 < k && ok == 1; i1++ ){
            for( int j = i1 + 1; j <= k && ok == 1; j++ ){
                if( List[ x[i1] ].find( x[j] ) == List[ x[i1] ].end() ){
                    ok = 0;
                }
            }
        }
        sol[k] += ok;
    }
    return ;
}
int main(){
    fin >> n >> m;
    for( int i = 1; i <= m; i++ ){
        fin >> a >> b;
        List[a].insert(b);
        List[b].insert(a);
        g[a]++;
        g[b]++;
    }
    for( int i = 1; i <= n; i++ ){
        if( g[i] < 6 ){
            q.push(i);
            f[i] = 1;
        }
    }
    while( !q.empty() ){
        nr = 0;
        int nod = q.front();
        v[++nr] = nod;
        for( set<int>::iterator it = List[nod].begin(); it != List[nod].end(); it++ ){
            v[++nr] = (*it);
        }
        solve();
        for( set<int>::iterator it = List[nod].begin(); it != List[nod].end(); it++ ){
            g[(*it)]--;
            if( g[(*it)] < 6 && f[(*it)] == 0 ){
                f[(*it)] = 1;
                q.push((*it));
            }
            set<int>::iterator it1 = List[(*it)].find( nod );
            List[(*it)].erase( it1 );
        }
        List[nod].clear();
        q.pop();
    }
    sol[1] = n;
    if( sol[4] != 0 ){
        fout << "4 " << sol[4];
        return 0;
    }
    if( sol[3] != 0 ){
        fout << "3 " << sol[3];
        return 0;
    }
    if( sol[2] != 0 ){
        fout << "2 " << sol[2];
        return 0;
    }
    if( sol[1] != 0 ){
        fout << "1 " << sol[1];
        return 0;
    }
    return 0;
}