#include<iostream>
#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 2e3 + 5;
int n, m;
int par[N];

int find_parent(int v) {
    if (v == par[v])return v;
    return par[v] = find_parent(par[v]);
}

int x[N], y[N];

struct graph {
    int L, R;
    vector<vector<int> > adj;

    graph(int l, int r) : L(l), R(r), adj(l + 1) {}

    void add_edge(int u, int v) {
        adj[u].push_back(v + L);
    }

    int maximum_matching() {
        vector<int> mate(L + R + 1, -1), level(L + 1);
        function<bool(void)> levelize = [&]() {
            queue<int> q;
            for (int i = 1; i <= L; i++) {
                level[i] = -1;
                if (mate[i] < 0)
                    q.push(i), level[i] = 0;
            }
            while (!q.empty()) {
                int node = q.front();
                q.pop();
                for (auto i: adj[node]) {
                    int v = mate[i];
                    if (v < 0)
                        return true;
                    if (level[v] < 0) {
                        level[v] = level[node] + 1;
                        q.push(v);
                    }
                }
            }
            return false;
        };
        function<bool(int)> augment = [&](int node) {
            for (auto i: adj[node]) {
                int v = mate[i];
                if (v < 0 || (level[v] > level[node] && augment(v))) {
                    mate[node] = i;
                    mate[i] = node;
                    return true;
                }
            }
            return false;
        };
        int match = 0;
        while (levelize())
            for (int i = 1; i <= L; i++)
                if (mate[i] < 0 && augment(i))
                    match++;
        return match;
    }
};

void doWork() {
    cin >> n >> m;
    graph g(n, n);

    for (int i = 1; i <= m; i++) {
        cin >> x[i] >> y[i];
        par[i] = i;
        g.add_edge(x[i], y[i]);
        for (int j = 1; j < i; j++) {
            if (x[i] == x[j] || y[i] == y[j]) {
                par[i] = find_parent(par[j]);
            }
        }
    }
    int ans2 = m;
    for (int i = 1; i <= m; i++) {
        if (find_parent(i) == i) {
            ans2--;
        }
    }
    cout << m - g.maximum_matching() << " " << ans2;
}

int main() {
    IO
    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}