#include <bits/stdc++.h>
using namespace std;
const int maxn = 51;
int n, k, a[5][maxn];
bool fl;
vector<int> res;
void Enter() {
  cin >> n >> k;
  for (int i = 1; i <= 4; ++i)
    for (int j = 1; j <= n; ++j) cin >> a[i][j];
}
void Init() {}
void Move(int i, int j, int i2, int j2) {
  fl = 0;
  res.push_back(a[i][j]);
  res.push_back(i2);
  res.push_back(j2);
  a[i2][j2] = a[i][j];
  a[i][j] = 0;
}
void Right(int i, int l, int r) {
  for (int j = r; j >= l; --j)
    if (a[i][j] != 0) Move(i, j, i, j + 1);
}
void Left(int i, int l, int r) {
  for (int j = l; j <= r; ++j)
    if (a[i][j] != 0) Move(i, j, i, j - 1);
}
void Up(int i, int j) {
  if (a[i][j] != 0) Move(i, j, i - 1, j);
}
void Down(int i, int j) {
  if (a[i][j] != 0) Move(i, j, i + 1, j);
}
void Solve() {
  if (k == 2 * n)
    fl = 1;
  else
    fl = 0;
  int CNT = 0;
  do {
    for (int j = 1; j <= n; ++j) {
      if (a[2][j] != 0 && a[1][j] == a[2][j]) Move(2, j, 1, j), --k;
      if (a[3][j] != 0 && a[4][j] == a[3][j]) Move(3, j, 4, j), --k;
    }
    if (fl == 1) {
      cout << -1;
      return;
    }
    for (int i = 2; i <= 3; ++i)
      for (int j = 1; j <= n; ++j)
        if (a[i][j] == 0) {
          if (i == 2) {
            Right(2, 1, j);
            Up(3, 1);
            Left(3, 1, n);
            if (j != n) Down(2, n);
            Right(2, j + 1, n);
          } else {
            Left(3, j, n);
            Down(2, n);
            Right(2, 1, n);
            if (j != 1) Up(3, 1);
            Left(3, 1, j - 1);
          }
          goto lab;
        }
  lab:;
  } while (k > 0);
  cout << res.size() / 3 << '\n';
  for (int st = 0; st + 2 < res.size(); st += 3)
    cout << res[st] << ' ' << res[st + 1] << ' ' << res[st + 2] << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  Enter();
  Init();
  Solve();
}
