#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i) 
#define R(i, j, k) for(int i = (j); i >= (k); --i) 
#define ll long long 
#define vi vector < int > 
#define ull unsigned long long 
#define sz(a) ((int) (a).size())
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 1 << 22, M = N * 20;
queue < int > q;

int Ha[N], f[N][11], mp[N];
int n, m, x[N], p[N], u[N];
inline int Hash(int *f) {
	int ret = 0;
	R(i, n, 1) {
		ret *= i;
		L(j, 1, i - 1) {
			ret += f[j] > f[i];
		}
	}
	return ret + 1;
}

int main() {
//	freopen("a.in", "r", stdin);
	int totp;
	cin >> totp >> n >> m;
	if(n > 10) 
		assert(false);
	L(i, 1, n) cin >> x[i];
	int aim = Hash(x);
	L(i, 1, n) p[i] = i;
	do {
		int w = Hash(p);
		assert(w < N);
		L(i, 1, n) f[w][i] = p[i];
	} while(next_permutation(p + 1, p + n + 1));
	q.push(1);
	while(!q.empty()) {
		int t = q.front();
		q.pop();
		L(i, 1, n) u[i] = f[t][i];
		if(t == aim) break;
		L(i, 1, n - m + 1) {
			reverse(u + i, u + i + m);
			int qwq = Hash(u);
			if(!mp[qwq]) q.push(qwq), mp[qwq] = t;
			reverse(u + i, u + i + m);
		}
	}
	
	if(aim != 1 && !mp[aim]) {
		cout << -1 << '\n';
		return 0;
	}
	
	vector < int > vc; 
	for(int u = aim; u != 1; u = mp[u]) {
		L(j, 1, n) 
			if(f[mp[u]][j] != f[u][j]) {
				vc.emplace_back(j - 1);
				break;
			}
	}
	cout << sz(vc) << '\n';
	for(auto u : vc) 
		cout << u << '\n';
	return 0;
}