Consider a non-empty array inarr containing non-zero positive single digit integers, separated by ','

Print a string based on the following conditions:

Form all possible unique 3 digit number combinations with the elements of inarr

Identify the maximum number among the three-digit combinations formed

Print maximum number along with the total number of unique three-digit combinations formed, separating them with a ','.

Assumption: inarr contains at least 3 elements

Note: An element present at a particular index should not be considered more than once while forming a combination.