Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given a 0-indexed array of positive integers nums. Find the number of triplets (i, j, k) that meet the following conditions:

0 <= i < j < k < nums.length
nums[i], nums[j], and nums[k] are pairwise distinct.
	
In other words, nums[i] != nums[j], nums[i] != nums[k], and nums[j] != nums[k].



Return the number of triplets that meet the conditions.
 
Please complete the following python code precisely:
```python
class Solution:
    def unequalTriplets(self, nums: List[int]) -> int:
```