#C4106. Anagram Checker

    ID: 47608 Type: Default 1000ms 256MiB

Anagram Checker

Anagram Checker

In this problem, you are required to determine whether two given strings are anagrams of each other.

Two strings are anagrams if they contain exactly the same characters, including spaces and respecting the case, albeit in possibly different orders. For example, "listen" and "silent" are anagrams, but "Triangle" and "Integral" are not (due to case sensitivity).

Your program should read input from standard input (stdin) and print the answer to standard output (stdout). For each test case, output True if the strings are anagrams, otherwise output False. Each result must be printed on a separate line.

inputFormat

The input begins with an integer T on the first line, representing the number of test cases. Each test case consists of two lines:

  • The first line of a test case is the first string.
  • The second line is the second string.

Note that the strings may contain spaces and are case-sensitive.

outputFormat

For each test case, output a single line containing either True if the two strings are anagrams, or False if they are not.

## sample
4
listen
silent
Triangle
Integral
Apple
Pleap
School Master
The Classroom
True

False False False

</p>