#include <bits/stdc++.h>
const long long MOD = 1000000007;
const long long inf = 1e18;
using namespace std;
long long int modpow(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1) res = res * x % MOD;
    x = x * x % MOD;
    n >>= 1;
  }
  return res;
}
long long int power(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1) res = res * x;
    x = x * x;
    n >>= 1;
  }
  return res;
}
void always_ignore_function_name() {
  int n, k;
  cin >> n >> k;
  int x = 0;
  int blank = 0;
  vector<std::pair<int, int>> v(2 * n + 1);
  vector<pair<int, pair<int, int>>> ans;
  for (int i = 1; i <= 4; i++) {
    for (int j = 1; j <= n; j++) {
      cin >> x;
      if (i == 1)
        v[j].second = x;
      else if (i == 2)
        v[j].first = x;
      else if (i == 3)
        v[2 * n - j + 1].first = x;
      else if (i == 4)
        v[2 * n - j + 1].second = x;
    }
  }
  for (int i = 1; i <= 2 * n; i++) {
    if (v[i].first == 0) {
      blank = i - 1;
      if (blank == 0) blank = 2 * n;
    } else if (v[i].first == v[i].second)
      blank = i;
  }
  if (blank == 0) {
    cout << -1 << endl;
    return;
  }
  int pp = 0;
  while (1) {
    int i = blank;
    if (v[i].first != 0) {
      if (v[i].first == v[i].second) {
        if (i > n)
          ans.push_back(make_pair(v[i].first, make_pair(4, 2 * n - i + 1)));
        else
          ans.push_back(make_pair(v[i].first, make_pair(1, i)));
        v[i].first = 0;
      } else {
        pair<int, pair<int, int>> ppp;
        ppp.first = v[i].first;
        if (i == 2 * n) {
          ppp.second.first = 2, ppp.second.second = 1;
        } else if (i == n) {
          ppp.second.first = 3, ppp.second.second = n;
        } else if (i <= n) {
          ppp.second.first = 2, ppp.second.second = i + 1;
        } else {
          ppp.second.first = 3, ppp.second.second = 2 * n - i;
        }
        int j = i + 1;
        if (j > 2 * n) j = 1;
        v[j].first = v[i].first;
        v[i].first = 0;
        ans.push_back(ppp);
      }
    }
    blank--;
    if (blank == 0) blank = 2 * n;
    int f = 1;
    for (int i = 1; i <= 2 * n; i++)
      if (v[i].first) f = 0;
    if (f) break;
  }
  assert(ans.size() <= 20000);
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i].first << " " << ans[i].second.first << " "
         << ans[i].second.second << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int t = 1, tt = 1;
  while (tt <= t) {
    always_ignore_function_name();
    tt++;
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
