8545: Kazuha's String

Kazuha has two strings S1 and S2 consisting of lowercase letters "a", "b" and "c", here are the possible operations:

Add or Delete "aa" at any place of the string.

Add or Delete "bbb" at any place of the string.

Add or Delete "cccc" at any place of the string.

Add or Delete "abababab" at any place of the string.

Add or Delete "acacac" at any place of the string.

Add or Delete "bcbc" at any place of the string.

Add or Delete "abc" at any place of the string.

Kazuha can operate any time with any operations, determine if s1 can be transformed into S2 .

The first line contains one integer T(1≤T≤2×105) .

The first line of each test case contains a single string S1 .

The second line of each test case contains a single string S2.

It guaranteed that the length of each string does not exceed 105, and the sum of string lengths does not exceed 2×106.