#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
long long dx[4] = {-1, 0, 0, +1};
long long dy[4] = {0, -1, +1, 0};
const long long LINF = 1e18;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
long long strtoll(string s) {
  stringstream str(s);
  long long number = 0;
  str >> number;
  return number;
}
string lltostr(long long n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
long long llsqrt(long long x) {
  if (x == 0 || x == 1) return x;
  long long start = 1, end = x / 2, ans;
  while (start <= end) {
    long long mid = (start + end) / 2;
    if (mid * mid == x)
      return mid;
    else if (mid <= x / mid)
      ans = mid, start = mid + 1;
    else
      end = mid - 1;
  }
  return ans;
}
vector<long long> spf;
void sieve(long long size) {
  spf.resize(size + 1);
  for (long long i = 1; i <= size; ++i) spf[i] = i;
  for (long long i = 4; i <= size; i += 2) spf[i] = 2;
  for (long long i = 3; i * i <= size; ++i) {
    if (spf[i] == i) {
      for (long long j = i * i; j <= size; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
long long power(long long a, long long b, long long m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long t = power(a, b / 2, m);
  t = (t * t) % m;
  if (b & 1) t = (t * a) % m;
  return t;
}
long long modInverse(long long a, long long m) { return power(a, m - 2, m); }
void fastscan(long long &number) {
  bool negative = false;
  register long long c;
  number = 0;
  c = getchar();
  if (c == '-') {
    negative = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;
  if (negative) number *= -1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n, k;
  cin >> n >> k;
  vector<long long> f(2 * n + 3), s(2 * n + 3);
  for (long long i = 0; i < n; i++) cin >> f[i];
  for (long long i = 0; i < n; i++) cin >> s[i];
  for (long long i = 0; i < n; i++) cin >> s[n - 1 - i + n];
  for (long long i = 0; i < n; i++) cin >> f[n + n - 1 - i];
  vector<pair<long long, pair<long long, long long> > > v;
  for (long long i = 0; i < 2 * n; i++) {
    if (f[i] == s[i] && s[i] != 0) {
      if (i < n) {
        v.push_back({f[i], {1, i + 1}});
        s[i] = 0;
      } else {
        long long idx = 2 * n - 1 - i;
        v.push_back({f[i], {4, idx + 1}});
        s[i] = 0;
      }
    }
  }
  long long p = 0;
  for (long long i = 0; i < 2 * n; i++) {
    if (s[i]) p++;
  }
  if (p == 2 * n) {
    cout << -1;
    return 0;
  }
  while (p) {
    long long j = 0;
    for (; j < 2 * n; j++) {
      if (!s[j]) {
        break;
      }
    }
    for (long long l = j + 1;; l++) {
      if (l % (2 * n) == j) {
        break;
      }
      if (!s[l % (2 * n)]) continue;
      if (l % (2 * n) < n) {
        long long idx = l % (2 * n);
        if (idx == 0) {
          v.push_back({s[l % (2 * n)], {3, 1}});
        } else {
          v.push_back({s[l % (2 * n)], {2, idx}});
        }
      } else {
        long long idx = l % (2 * n);
        idx = 2 * n - 1 - idx;
        if (idx == n - 1) {
          v.push_back({s[l % (2 * n)], {2, n}});
        } else {
          v.push_back({s[l % (2 * n)], {3, idx + 2}});
        }
      }
      long long b = s[l % (2 * n)];
      s[l % (2 * n)] = s[(l - 1 + 2 * n) % (2 * n)];
      s[(l - 1 + 2 * n) % (2 * n)] = b;
    }
    p = 0;
    for (long long i = 0; i < 2 * n; i++) {
      if (s[i] == f[i] && s[i] != 0) {
        if (i < n) {
          v.push_back({f[i], {1, i + 1}});
          s[i] = 0;
        } else {
          long long idx = 2 * n - 1 - i;
          v.push_back({f[i], {4, idx + 1}});
          s[i] = 0;
        }
      } else if (f[i] != s[i] && s[i] != 0)
        p++;
    }
  }
  cout << v.size() << endl;
  for (long long i = 0; i < v.size(); i++)
    cout << v[i].first << " " << v[i].second.first << " " << v[i].second.second
         << endl;
  return 0;
}
