Count Subarrays With K Distinct Integers

Description

You are given an integer array nums and two integers k and m.

Return an integer denoting the count of subarrays of nums such that:

- The subarray contains exactly k distinct integers.

- Within the subarray, each distinct integer appears at least m times.