#include <bits/stdc++.h>
using namespace std;
int getCount(int n,vector<int>arr,int k){
	int count=0;
	for(int i=0;i<n;i++){
		unordered_map<int,int>mp;
		for(int j=i;j<n;j++){
			mp[arr[j]]++;
			int s=mp.size();
			if(s<=k){
				count++;
			}
		}
	}
	return count;
}
 
int main() {
	// your code goes here
	int n;
	cin>>n;
	vector<int>arr(n,0);
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	int k;
	cin>>k;
	cout<<"The number of subarrays with distinct elemets less tha k is:"<<getCount(n,arr,k);
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBnZXRDb3VudChpbnQgbix2ZWN0b3I8aW50PmFycixpbnQgayl7CglpbnQgY291bnQ9MDsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCXVub3JkZXJlZF9tYXA8aW50LGludD5tcDsKCQlmb3IoaW50IGo9aTtqPG47aisrKXsKCQkJbXBbYXJyW2pdXSsrOwoJCQlpbnQgcz1tcC5zaXplKCk7CgkJCWlmKHM8PWspewoJCQkJY291bnQrKzsKCQkJfQoJCX0KCX0KCXJldHVybiBjb3VudDsKfQogCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PmFycihuLDApOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJY2luPj5hcnJbaV07Cgl9CglpbnQgazsKCWNpbj4+azsKCWNvdXQ8PCJUaGUgbnVtYmVyIG9mIHN1YmFycmF5cyB3aXRoIGRpc3RpbmN0IGVsZW1ldHMgbGVzcyB0aGEgayBpczoiPDxnZXRDb3VudChuLGFycixrKTsKCXJldHVybiAwOwp9

MwoxIDIgMwoy

3
1 2 3
2