#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC oprimize("unrol-loops")

#define vec vector
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define int long long

using namespace std;

typedef pair<int, int> pii;

const int inf = 2e18;
int mod = 100000007;


void solve(){
    int n,m,c;
    cin>>n>>m>>c;
    vector<pair<int,int> > a(m+1);
    for(int i=0;i<n;i++){
        int x,y;
        cin>>x>>y;
        if(a[x].fi+a[x].se<c)
            a[x].fi++;
        else if(a[y].fi+a[y].se<c)
            a[y].se++;
    }
    int ans1 = 0;
    int ans2 = 0;
    for(int i = 1;i<=m;i++){
        ans1+=a[i].fi;
        ans2+=a[i].se;
    }
    cout<<ans1<<" "<<ans2<<endl;

}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tests = 1;
    while(tests--){
        solve();
    }
}