//#pragma GCC optimize ("-O3","unroll-loops")
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define m0(x) memset(x,0,sizeof(x))
#define print(x) cout<<x<<'\n';
#define pe(x) cout<<x<<" ";
#define lb(v,n) lower_bound(v.begin(), v.end(), n);
#define ub(v,n) upper_bound(v.begin(), v.end(), n);
//#define int long long
#define all(x) (x).begin(), (x).end()
//#define double long double

using namespace std;

template<class T> inline bool chmin(T& a, T b) {
	if (a > b) {
		a = b;
		return true;
	}
	return false;
}
template<class T> inline bool chmax(T& a, T b) {
	if (a < b) {
		a = b;
		return true;
	}
	return false;
}

const int MOD = 1000099253;
const int MOD2 = 1000311461;
const ll INF = 1e17;
const int INT_INF = 1e9;
const double pi = acos(-1);
const double EPS = 1e-10;
typedef pair<int, int>P;
const int MAX = 100010;

//Ford-Fulkerson法で最大流を求める O(F|E|)
const int MAX_V = 2010;
struct edge { int to, cap, rev; };
vector<edge>G[MAX_V];
bool used[MAX_V];

void add_edge(int from, int to, int cap) {
	G[from].push_back({ to, cap, (int)G[to].size() });
	G[to].push_back({ from,0,(int)G[from].size() - 1 });
}
int dfs(int v, int t, int f) {
	if (v == t)return f;
	used[v] = true;
	for (int i = 0; i < G[v].size(); i++) {
		edge &e = G[v][i];
		if (!used[e.to] && e.cap > 0) {
			int d = dfs(e.to, t, min(f, e.cap));
			if (d > 0) {
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}
int max_flow(int s, int t) {
	int flow = 0;
	for (;;) {
		memset(used, 0, sizeof(used));
		int f = dfs(s, t, INT_INF);
		if (f == 0) {
			return flow;
		}
		flow += f;
	}
}

int siz[MAX];//錬結成分のサイズ
int par[MAX];//親
int Rank[MAX];//木の深さ

//n要素で初期化
void init(int n) {
	REP(i, n) {
		par[i] = i;
		Rank[i] = 0;
		siz[i] = 1;
	}
}

//木の根を求める
int find(int x) {
	if (par[x] == x) {
		return x;
	}
	else {
		return par[x] = find(par[x]);//経路圧縮(根に直接つなぎなおす)もしつつ
	}
}

//xとyの属する集合を併合
void unite(int x, int y) {
	x = find(x);
	y = find(y);
	if (x == y)return;
	//低いほうを高いほうにつなげる(効率化)
	if (Rank[x] < Rank[y]) {
		par[x] = y;
		siz[x] += siz[y];
		siz[y] = siz[x];
	}
	else {
		siz[y] += siz[x];
		siz[x] = siz[y];
		par[y] = x;
		if (Rank[x] == Rank[y])Rank[x]++;
	}
}

//xとyが同じ集合に属するか否か
bool same(int x, int y) {
	return find(x) == find(y);
}


vector<int>X[1010], Y[1010];
set<int>S[1010];
int x[1010], y[1010];
int ans2 = 0;
bool vis[1010];
void dfs2(int n) {
	vis[n] = true;
	for (auto nex : S[n]) {
		if (vis[nex])continue;
		dfs2(nex);
	}
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, M; cin >> N >> M;
	int s = 0, t = 2*N+1;
	init(M + 1);
	FOR(i, 1, N + 1) {
		add_edge(s, i, 1);
		add_edge(i+N, t, 1);
	}
	REP(i, M) {
		cin >> x[i] >> y[i];
		X[x[i]].pb(i); Y[y[i]].pb(i);
		
		add_edge(x[i], y[i]+N, 1);
		//add_edge(y[i] + N, x[i], 1);
	}
	REP(i, M) {
		REP(j, M) {
			if (i == j)continue;
			if (x[i] == x[j] || y[i] == y[j]) {
				unite(i, j);
				S[i].insert(j);
				S[j].insert(i);
			}
		}
	}
	/*REP(i, M) {
		for (auto v : X[x[i]]) {
			if (v == i)continue;
			S[i].insert(v);
			S[v].insert(i);
		}
		for (auto v : Y[y[i]]) {
			if (v == i)continue;
			S[i].insert(v);
			S[v].insert(i);
		}
	}*/
	int mx = max_flow(s, t);
	int ans1 = M - mx;
	int res2 = 0;
	REP(i, M) {
		if (find(i) == i)res2++;
	}
	/*REP(i, M) {
		if (vis[i])continue;
		res2++;
		dfs2(i);
	}*/
	ans2 = M - res2;
	pe(ans1)print(ans2);
}
