// TC : O(N^2)
// SC : O(N)
 
#include <iostream>
#include<unordered_map>
using namespace std;
 
int main() {
	int n;
	cin >> n;
 
	int arr[n];
	for(int i=0; i<n; i++) {
		cin >> arr[i];
	}
 
	int count = 0;
	int k;
	cin >> k;
 
	int sum = 0;
 
	for(int i=0; i<n; i++) {
		unordered_map<int, int> mp;
 
		for(int j=i; j<n; j++) {
			mp[arr[j]]++;
			int distinct = mp.size();
			if(distinct <= k) {
				count++;
			} else {
				break;
			}
		}
	}
	cout << "Count : " << count;
	return 0;
}

Ly8gVEMgOiBPKE5eMikKLy8gU0MgOiBPKE4pCgojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlPHVub3JkZXJlZF9tYXA+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luID4+IG47CgkKCWludCBhcnJbbl07Cglmb3IoaW50IGk9MDsgaTxuOyBpKyspIHsKCQljaW4gPj4gYXJyW2ldOwoJfQoJCglpbnQgY291bnQgPSAwOwoJaW50IGs7CgljaW4gPj4gazsKCQoJaW50IHN1bSA9IDA7CgkKCWZvcihpbnQgaT0wOyBpPG47IGkrKykgewoJCXVub3JkZXJlZF9tYXA8aW50LCBpbnQ+IG1wOwoJCQoJCWZvcihpbnQgaj1pOyBqPG47IGorKykgewoJCQltcFthcnJbal1dKys7CgkJCWludCBkaXN0aW5jdCA9IG1wLnNpemUoKTsKCQkJaWYoZGlzdGluY3QgPD0gaykgewoJCQkJY291bnQrKzsKCQkJfSBlbHNlIHsKCQkJCWJyZWFrOwoJCQl9CgkJfQoJfQoJY291dCA8PCAiQ291bnQgOiAiIDw8IGNvdW50OwoJcmV0dXJuIDA7Cn0=

NQoxCjIKMgo1CjgKNA==

5
1
2
2
5
8
4