Determine all triplets (X, Y, Z) of base 12 positive integers such that the duodecimal representation of X^Y*(X+1)^Z has no leading zeroes and contains each of the digits from 0 to B exactly once, with the restriction that: at least one of Y and Z is different from 1.

What is the total number of such triplets without any restriction?