#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000009
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(const auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

int visit[MAX_N];

void dfs(int u, int& deg, int& ver, int& cnt, vector<int>& vers, const int id, const vector<unordered_set<int> >& G){
    if(deg < (int)G[u].size()){
        deg = (int)G[u].size(), ver = u, cnt = 1;
    }else if(deg == (int)G[u].size()){
        ++cnt;
    }
    visit[u] = id, vers.push_back(u);
    for(const int v : G[u]){
        if(visit[v] != id) dfs(v, deg, ver, cnt, vers, id, G);
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector<unordered_set<int> > G(n);
    unordered_set<int> st;
    rep(i,n) st.insert(i);
    int x, y;
    rep(i,m){
        cin >> x >> y;
        --x, --y;
        G[x].insert(y), G[y].insert(x);
    }
    int id = 1, hoge = 0, ans = 1;
    while(!st.empty()){
        const int v = *st.begin();
        // show(v);
        vector<int> vers;
        int deg = -1, ver = -1, cnt = 0;
        dfs(v, deg, ver, cnt, vers, id++, G);
        // show(vers), show(cnt);
        if(cnt == (int)vers.size()){
            ++hoge;
            ans = (ll)ans * cnt % MOD;
            if(vers.size() == st.size()) break;
            for(const int u : vers) st.erase(u);
        }else{
            for(const int u : G[ver]) G[u].erase(ver);
            st.erase(ver);
        }
    }
    cout << hoge << "\n";
    cout << ans << "\n";
    return 0;
}


Measured memory_bytes: 30132