Given a string and a sub-string, your task is to find the last index of that sub-string that appears in the given String.
If the given sub-string doesn't appear in the string then print "-1".
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contain a sub-string S and a string S1.
For each test case in a new line print the required result.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.