You are given two string S and T of length n and m respectively.
Find a strictly increasing array of m integers A1,A2,…,Am where Ai is the index of the character in S that matches with Ti.i.eSAi=Ti.
Among all possible arrays find the one where the summation of the absolute difference between each adjacent element is maximum. i.ei=1∑i<mAi+1−Ai is maximum. If there are multiple answers find the one where the summation of the elements in the array is maximum. i.ei=1∑i≤mAi is maximum.
If such an array does not exist, print −1.
Input
The first line of input will contain two integers n and m(1≤n,m≤2∗105).
The second line will contain a string S of length n.
The third line will contain a string T of length m.
Output
Print m integers A1,A2,…,Am the array you have found. If such an array does not exist, print −1.