#include <bits/stdc++.h>
using namespace std;
static constexpr int maxn = 1000 + 5;

struct Match {
    vector<int> X[maxn];
    int fX[maxn], fY[maxn], n;
    bitset<maxn> vis;
    bool dfs(int x) {
        for (auto i : X[x]) {
            if (not vis[i]) {
                vis[i] = true;
                if (fY[i] == -1 or dfs(fY[i])) {
                    fY[fX[x] = i] = x;
                }
                return true;
            }
        }
        return false;
    }
    void init(int n_, int m) {
        vis.reset();
        fill_n(X, n = n_, vector<int>());
        memset(fX, -1, sizeof(int) * n);
        memset(fY, -1, sizeof(int) * m);
    }
    void add_edge(int x, int y) { X[x].push_back(y); }
    int solve() {
        for (int i = 0; i < n; ++i) {
            vis.reset();
            dfs(i);
        }
        int cnt = 0;
        for (int i = 0; i < n; ++i)
            cnt += fX[i] != -1;
        return cnt;
    }
} ma;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m; cin >> n >> m;
    ma.init(n, n);
    vector<vector<int>> g(n + n);
    for (int i = 0; i < m; ++i) {
        int a, b; cin >> a >> b;
        --a, --b;
        ma.add_edge(a, b);
        g[a].push_back(b + n);
        g[b + n].push_back(a);
    }
    auto count = [&]{
        int ans = 0;
        vector<bool> vis(n + n);
        auto dfs = [&](auto self, int i) -> void {
            vis[i] = true;
            for (int j : g[i]) {
                if (not vis[j]) self(self, j);
            }
        };
        for (int i = 0; i < n + n; ++i) {
            if (vis[i]) continue;
            if (g[i].empty()) continue;
            dfs(dfs, i);
            ans++;
        }
        return ans;
    };
    cout << m - ma.solve() << ' ' << m - count() << '\n';
    return 0;
}