eolymp
bolt
Try our new interface for solving problems
Problems

Corrupted password

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 (1x ≤ |s|) and changed sx to character c (sxc).
  • 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| ≤ 106). The second line contains the string t, consisting of lowercase English letters (|s| ≤ |t| ≤ 106).

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 sxc must be true. If there are multiple answers, you can print any one.

Time limit 1 second
Memory limit 128 MiB
Input example #1
abc
aacc
Output example #1
2 a
Source 2021 ITMO University, First personal olympiad, January 31, Problem B