#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;


//* Template 1 : 

int consistency1(int n, int m, int k){
	
	unordered_map<int,int> big, sm;
	
	int s = 0, e = 0;
	int l = 0;
	
	int ans = 0;
	
	int distinct = 0; //* total distinct ele in big window
	int count = 0; //* total >=m ele's in small window
	
	while(e<n){
		big[a[e]]++;
		if(big[a[e]] == 1) distinct++;
		
		sm[a[e]]++;
		if(sm[a[e]] == m) count++;
		
		while(l<=e && count >= k){
			sm[a[l]]--;
			if(sm[a[l]] == m-1) count--;
			if(sm[a[l]] == 0) sm.erase(a[l]);
			l++;
		}
		
		if(distinct < k){
			e++;
		}
		else{
			while(s<=e && distinct > k){
				
				big[a[s]]--;
				if(big[a[s]] == 0){
					distinct--;
					big.erase(a[s]);
				}
				s++;
			}
			
			if(l>=s) ans += l-s;
			
			e++;
		}
	}
	
	return ans;
}





//* Template 2 : 

int consistency2(int n, int m, int k){
	
	unordered_map<int,int> big, sm;
	
	int s = 0, e = 0;
	int l = 0;
	
	int ans = 0;
	
	int distinct = 0; //* total distinct ele in big window
	int count = 0; //* total >=m ele's in small window
	
	while(e<n){
		big[a[e]]++;
		if(big[a[e]] == 1) distinct++;
		
		sm[a[e]]++;
		if(sm[a[e]] == m) count++;
		
		while(l<=e && count >= k){
			sm[a[l]]--;
			if(sm[a[l]] == m-1) count--;
			if(sm[a[l]] == 0) sm.erase(a[l]);
			l++;
		}
		
		while(s<=e && distinct > k){
			
			big[a[s]]--;
			if(big[a[s]] == 0){
				distinct--;
				big.erase(a[s]);
			}
			s++;
		}
		
		if(l>=s) ans += l-s;
		
		e++;
	}
	
	return ans;
}




















int practice(int n, int m, int k){


    return 0;
}





void solve() {
    
    int n, m, k;
    cin>> n >> m >> k;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n, m, k) << " " << consistency2(n, m, k) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}