codeforces div3 501 B Obtaining the String

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 s

and t. Both strings have length n and consist of lowercase Latin letters. The characters in the strings are numbered from 1 to n

.

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

• swap any two adjacent (neighboring) characters of s

(i.e. for any i={1,2,…,n−1} you can swap si and si+1)

• .

You can't apply a move to the string t

. The moves are applied to the string s

one after another.

Your task is to obtain the string t

from the string s. Find any way to do it with at most 104

such moves.

You do not have to minimize the number of moves, just find any sequence of moves of length 104

or less to transform s into t

.

Input

The first line of the input contains one integer n

(1≤n≤50) — the length of strings s and t

.

The second line of the input contains the string s

consisting of n

lowercase Latin letters.

The third line of the input contains the string t

consisting of n

lowercase Latin letters.

Output

If it is impossible to obtain the string t

using moves, print "-1".

Otherwise in the first line print one integer k

— the number of moves to transform s to t. Note that k must be an integer number between 0 and 104

inclusive.

In the second line print k

integers cj (1≤cj<n), where cj means that on the j-th move you swap characters scj and scj+1

.

If you do not need to apply any moves, print a single integer 0

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 s

changes as follows: "abcdef" → "abdcef" → "abdcfe" → "abdfce" →

"abdfec".

In the second example there is no way to transform the string s

into the string t through any allowed moves.

题意：

给你两个字符串a， b和它们的长度， 每次只能移动前后两个字母， 求字符串a最少需要移动多少次才能变成字符串b。
当时做这个题的时候可把我吓坏了。然后我就把这题跳过去了。 补题的时候看了个学长的代码发现如此简单， 果然还是自己太笨了。

（ 1）先比较两个字符串的大小， 如果不相等的话再怎么移也变不成b。

（ 2）再接下来就是模拟过程了， 从头挨个字符串比较， 直到不相等的时候， 然后找从a中找当前与b[i]相等的值， 然后将它移动到a[i]这个位置， 记录下步数。 然后以此类推。

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <queue>
//1584
using namespace std;
char a[50],b[50];
char aa[50],bb[50];
int main()
{
    int n;
    scanf("%d",&n);
    scanf("%s\n%s",a,b);
    strcpy(aa,a);
    strcpy(bb,b);
    sort (aa,aa+n);
    sort (bb,bb+n);
    queue<int>q;
    if(strcmp(aa,bb)!=0)
        printf("-1\n");
    else
    {
        for (int i=0;i<n;i++)
        {
            if(a[i]==b[i])
               continue;
                for (int j=i;j<n;j++)
                {
                    if(b[i]==a[j])
                    {
                        for (int k=j;k>i;k--)
                            {
                                  q.push(k);
                                  swap(a[k],a[k-1]);
                            }break;
                    }

                }
        }
        printf("%d\n",q.size());
        while (!q.empty())
        {
            printf("%d ",q.front());
            q.pop();
        }
        printf("\n");
    }

    return 0;
}