#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")

#define int long long
#define pb push_back
#define all(s) s.begin(),s.end()
#define pii pair<int,int>
#define fr first
#define sc second
#define bst ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;

using namespace std;

const int N = 5e5 + 10, mod = 1e9 + 7, inf = 1e18 + 7, logn = 23;
const double pi = acos(-1);

vector<int> gr[N];
int vis[N], tmp, tin[N], fup[N], timer = 0;

map<pii, int> mp;

void dfs1(int v, int pr = -1) {
	vis[v] = 1;
	tmp++;
	tin[v] = fup[v] = timer++;
	for(auto to: gr[v]) {
		if(to == pr) continue;

		if(!vis[to]) {
			dfs1(to, v);
			fup[v] = min(fup[v], fup[to]);
			if(fup[to] > tin[v]) {
				mp[{to, v}] = 1;
				mp[{v, to}] = 1;
			}
		} else {
			fup[v] = min(fup[v], tin[to]);
		}
	}
}

void dfs2(int v) {
	vis[v] = 1;
	tmp++;
	for(auto it: gr[v]) {
		if(vis[it] || mp[{v, it}]) {
			continue;
		}
		dfs2(it);
	}
}
void solve() {
	//soln
	int n, m;
	cin >> n >> m;

	while(m--) {
		int l, r;
		cin >> l >> r;
		gr[l].pb(r);
		gr[r].pb(l);
	}
	int k = 0, cnt = 1;
	for(int i = 1; i <= n; i++) {
		k += (gr[i].size() == 1);
	}
	dfs1(1);

	memset(vis, 0, sizeof vis);

	for(int i = 1; i <= n; i++) {
		tmp = 0;
		if(!vis[i]) dfs2(i);
		if(tmp) cnt *= tmp;
		if(tmp > 1) {
    	k++;
    }
	}
	cout << k << " " << cnt << endl;
}
main() {
	bst;
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
}