Valid Palindrome Checker

This problem requires you to check whether a given string is a valid palindrome. A valid palindrome is defined as a string that reads the same forward and backward after converting all letters to lowercase and removing all non-alphanumeric characters. In mathematical terms, if we let \( s \) be the processed string and \( s^R \) its reverse, then the condition for a palindrome is:

\( s = s^R \)

For example, the input "A man, a plan, a canal: Panama" should produce an output of "True".

inputFormat

The first line of input contains an integer \( T \) representing the number of test cases. Each of the next \( T \) lines contains a string \( s \) that you need to evaluate.

outputFormat

For each test case, output a single line containing "True" if the processed string is a palindrome, and "False" otherwise.

## sample

1
A man, a plan, a canal: Panama

True

</p>