Function to find the number with largest composite product of digits from the indices not divisible by k from the given array
def largestCompositeDigitProduct ( a , n , k ) : NEW_LINE INDENT pq = [ ] NEW_LINE DEDENT