#include <bits/stdc++.h>
using namespace std;
char s[2005], b[2005];
int vis1[30], vis2[30];
vector<int> V;
char now[2005];
int len;
void solve(int idx) {
  int i;
  for (i = 1; i <= len; i++)
    if (now[i] == s[idx]) break;
  int tmp = len - i;
  V.push_back(tmp);
  V.push_back(1);
  V.push_back(len);
  int nowidx = 1;
  char tmpnow[2005];
  for (int j = i - 1; j >= 1; j--, nowidx++) tmpnow[nowidx] = now[j];
  for (int j = i + 1; j <= len; j++, nowidx++) tmpnow[nowidx] = now[j];
  tmpnow[nowidx] = now[i];
  for (int i = 1; i <= len; i++) now[i] = tmpnow[i];
}
int main() {
  int T;
  scanf("%d", &T);
  V.clear();
  scanf("%s %s", b + 1, s + 1);
  memset(vis1, 0, sizeof(vis1));
  memset(vis2, 0, sizeof(vis2));
  len = strlen(s + 1);
  for (int i = 1; i <= len; i++) vis1[s[i] - 'a']++, vis2[b[i] - 'a']++;
  bool flag = 1;
  for (int i = 0; i < 26; i++)
    if (vis1[i] != vis2[i]) {
      flag = 0;
      break;
    }
  if (!flag)
    puts("-1");
  else {
    int i;
    for (i = len; i >= 1; i--)
      if (b[i] == s[1]) break;
    if (i != len) V.push_back(len - i);
    int idx = 1;
    for (int j = len; j > i; j--, idx++) now[idx] = b[j];
    for (int j = 1; j <= i; j++, idx++) now[idx] = b[j];
    for (int i = 2; i <= len; i++) solve(i);
    int Size = V.size();
    printf("%d\n", Size);
    for (int i = 0; i < Size; i++) {
      printf("%d ", V[i]);
    }
  }
}
