Permutation Check

Given two strings, determine whether the first string is a permutation of the second string. Two strings are said to be permutations of each other if they have the same characters in the same frequency, regardless of the order.

Note: The comparison is case-sensitive. For example, "Dog" is not a permutation of "god".

Mathematically, if we denote the frequency of character c in a string S as \( f_S(c) \), then two strings \( s_1 \) and \( s_2 \) are permutations if and only if:

\( f_{s_1}(c) = f_{s_2}(c) \) for every character \( c \).

inputFormat

The input consists of exactly two lines. The first line contains the first string, and the second line contains the second string. The strings may contain spaces and are case-sensitive.

outputFormat

Output a single line with either "True" if the first string is a permutation of the second string, or "False" otherwise.

abc
bca

True