Codeforces Round #501 (Div. 3) B（暴力）

B. Obtaining the String

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given two strings ss and tt. Both strings have length nn and consist of lowercase Latin letters. The characters in the strings are numbered from 11 to nn.

You can successively perform the following move any number of times (possibly, zero):

• swap any two adjacent (neighboring) characters of ss (i.e. for any i={1,2,…,n−1}i={1,2,…,n−1} you can swap sisi and si+1)si+1).

You can't apply a move to the string tt. The moves are applied to the string ss one after another.

Your task is to obtain the string tt from the string ss. Find any way to do it with at most 104104 such moves.

You do not have to minimize the number of moves, just find any sequence of moves of length 104104 or less to transform ss into tt.

Input

The first line of the input contains one integer nn (1≤n≤501≤n≤50) — the length of strings ss and tt.

The second line of the input contains the string ss consisting of nn lowercase Latin letters.

The third line of the input contains the string tt consisting of nn lowercase Latin letters.

Output

If it is impossible to obtain the string tt using moves, print "-1".

Otherwise in the first line print one integer kk — the number of moves to transform ss to tt. Note that kk must be an integer number between 00and 104104 inclusive.

In the second line print kk integers cjcj (1≤cj<n1≤cj<n), where cjcj means that on the jj-th move you swap characters scjscj and scj+1scj+1.

If you do not need to apply any moves, print a single integer 00 in the first line and either leave the second line empty or do not print it at all.

Examples

input

Copy

6
abcdef
abdfec

output

Copy

4
3 5 4 5 

input

Copy

4
abcd
accd

output

Copy

-1

Note

In the first example the string ss changes as follows: "abcdef" →→ "abdcef" →→ "abdcfe" →→ "abdfce" →→ "abdfec".

In the second example there is no way to transform the string ss into the string tt through any allowed moves.

 

先判断每个字母在两个串内的出现次数是否相同，如果不同的话显然是-1

那么，我们直接暴力找到每个str2[i]对应的str1[i]的位置，然后挪过来就可以了。

因为串长最多50，最差情况下是50*50次，显然符合条件。

（少写个break 被hack了 果然还是菜的抠脚）

 #include<bits/stdc++.h>
#define mp make_pair
#define fir first
#define se second
#define ll long long
#define pb push_back
using namespace std;
const int maxn=2e5+10;
const ll mod=1e9+7;
const int maxm=1e6+10;
const double eps=1e-7;
const int inf=0x3f3f3f3f;
const double pi = acos (-1.0);
int n;
string str1,str2;
int num[30],num1[30];
vector<int> ans;
int main(){
    cin>>n;
    cin>>str1>>str2;
    for (int i=0;i<str1.size();i++){
        num[str1[i]-'a']++;
        num1[str2[i]-'a']++;
    }
    for (int i=0;i<26;i++){
        if (num[i]!=num1[i]){
            cout<<-1<<endl;
            return 0;
        }
    }
    for (int i=0;i<str2.size();i++){
        for (int j=i;j<str1.size();j++){
            if(str2[i]==str1[j]){
                for (int k=j;k>i;k--){
                    ans.pb(k);
                    swap(str1[k],str1[k-1]);
                }
                break;
            }
        }
    }
    cout<<ans.size()<<endl;
    for (int i=0;i<ans.size();i++)
        cout<<ans[i]<<" ";
    cout<<endl;
    return 0;
}