#C2517. Anagram Checker

    ID: 45842 Type: Default 1000ms 256MiB

Anagram Checker

Anagram Checker

Given two strings s and t, determine if t is an anagram of s. Two strings are anagrams if they have the same characters and the same frequency for each character. Formally, if we denote the count of a character c in a string s as \(\text{count}_s(c)\), then t is an anagram of s if

\( |s| = |t| \quad \text{and} \quad \forall c,\; \text{count}_s(c) = \text{count}_t(c) \)

for example, "anagram" is an anagram of "nagaram", but "rat" is not an anagram of "car".

inputFormat

The input is given from standard input (stdin) and consists of two lines. The first line contains the string s, and the second line contains the string t.

outputFormat

Output a single line to standard output (stdout), which is either True if t is an anagram of s, or False otherwise.

## sample
anagram
nagaram
True