Given an array of $n$ integers, your task is to calculate the number of subarrays that have at most $k$ distinct values.
The first input line has two integers $n$ and $k$ .
The next line has $n$ integers $x_1,x_2,\dots,x_n$ : the contents of the array.
Print one integer: the number of subarrays.