#define _CRT_SECURE_NO_WARNINGS

	#include <bits/stdc++.h>
	using namespace std;
	#define loop(i, n) for(int i=0; i<n; i++)
	#define int long long
	const int INF = 2e18 + 7;
	const int MAXN = 4e5 + 5;
	vector<bool> used(MAXN);
	vector<int> g[MAXN], tin(MAXN), fup(MAXN), gg(MAXN);
	int timerr;
	vector<pair<int, int> > edge;
	vector<int> tt(MAXN);
	void dfs(int u, int p) {
		used[u] = 1;
		tin[u] = fup[u] = timerr++;
		tt[fup[u]]++;
		for (auto i : g[u]) {
			if (i == p) continue;
			if (used[i]) {
				tt[fup[u]]--;
				fup[u] = min(fup[u], tin[i]);
				tt[fup[u]]++;
			}
			else {
				dfs(i, u);
				tt[fup[u]]--;
				fup[u] = min(fup[i], fup[u]);
				tt[fup[u]]++;
				if (fup[i] > tin[u]) {
					edge.push_back({ u, i });
				}
			}
		}
	}
	signed main() {
		int n, m;
		cin >> n >> m;
		for (int i = 0; i < m; i++) {
			int u, v;
			cin >> u >> v;
			u--; v--;
			g[u].push_back(v);
			g[v].push_back(u);
		}
		dfs(0, -1);

		for (auto i : edge) {
			gg[fup[i.first]]++;
			gg[fup[i.second]]++;
		}
		int ans = 1, ch = 0;
		for (int i = 0; i < n; i++) {
			if (gg[i] == 1) {
				ch++;
				ans = (ans * tt[i]) % 1000000007;
			}
		}
		if (ch == 0) cout << 1 << " " << n;
		else cout << ch << " " << ans;
	}