Input starts with a line containing an integer 1 ≤ N ≤ 50. The next N lines are each a single phrase, possibly containing upper and lower case letters, spaces, decimal digits and punctuation characters ‘.’, ‘,’, ‘?’, ‘!’, ‘’’ and ‘"’. Each phrase contains at least one and no more than 100 characters.
For each input phrase, output “pangram” if it qualifies as a pangram. Otherwise, output the word “missing” followed by a space and then the list of letters that didn’t occur in the phrase. The list of missing letters should be reported in lower case and should be sorted alphabetically.
3 The quick brown fox jumps over the lazy dog. ZYXW, vu TSR Ponm lkj ihgfd CBA. .,?!’" 92384 abcde FGHIJ
pangram missing eq missing klmnopqrstuvwxyz