Easy solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def countDistinct(self, nums: List[int], k: int, p: int) -> int:
        f1 = set()  
        
        for i in range(len(nums)):
            c = 0
            f = []
            for j in range(i, len(nums)):
                f.append(nums[j])
                if nums[j] % p == 0:
                    c += 1
                if c > k:
                    break
                f1.add(tuple(f)) 
        
        return len(f1)

```
['Python3']