Corrupted password
Vi had a very important secret string s. He applied the following sequence of actions to it:
Selected position x in string s (1 ≤ x ≤ |s|) and changed
s[x]to character c (s[x]≠ c).Several, perhaps zero, times inserted a new character in an arbitrary place in the string. A character can be inserted before the first character, between two adjacent characters, or after the last character.
As a result, he got the string t. You are given strings s and t. Help Vi to remember which position he chose x and symbol c.
Input
The first line contains the string s, consisting of lowercase English letters (1 ≤ |s| ≤ 10^6). The second line contains the string t, consisting of lowercase English letters (|s| ≤ |t| ≤ 10^6).
It is guaranteed that t was obtained from s as a result of the described process.
Output
Print the position x and character c that Vi might have chosen. Note that s[x] ≠ c must be true. If there are multiple answers, you can print any one.