Anagrams

Two words $A$ and $B$ are given. If you can rearrange the order of the letters in $A$ to form $B$, then $A$ and $B$ are called anagrams of each other.

Write a program that determines whether two given words are anagrams.

The first line contains the number of test cases $T$ ($T < 100$).

Each of the following test cases consists of a single line containing two words separated by a space. Each word has length at most $100$ and consists only of lowercase English letters.

For each test case, if the two words are anagrams, print

A & B are anagrams.

Otherwise, print

A & B are NOT anagrams.

on its own line, where A and B are the two words given in the input.