Problem: Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types of cars he will own and how he will arrange them, he realizes that he has a problem. 

Allen's future parking lot can be represented as a rectangle with 4 rows and n (n ≤ 50) columns of rectangular spaces, each of which can contain at most one car at any time. He imagines having k (k ≤ 2n) cars in the grid, and all the cars are initially in the second and third rows. Each of the cars also has a different designated parking space in the first or fourth row. Allen has to put the cars into corresponding parking places.

<image> Illustration to the first example.

However, since Allen would never entrust his cars to anyone else, only one car can be moved at a time. He can drive a car from a space in any of the four cardinal directions to a neighboring empty space. Furthermore, Allen can only move one of his cars into a space on the first or fourth rows if it is the car's designated parking space. 

Allen knows he will be a very busy man, and will only have time to move cars at most 20000 times before he realizes that moving cars is not worth his time. Help Allen determine if he should bother parking his cars or leave it to someone less important.

Input

The first line of the input contains two space-separated integers n and k (1 ≤ n ≤ 50, 1 ≤ k ≤ 2n), representing the number of columns and the number of cars, respectively.

The next four lines will contain n integers each between 0 and k inclusive, representing the initial state of the parking lot. The rows are numbered 1 to 4 from top to bottom and the columns are numbered 1 to n from left to right.

In the first and last line, an integer 1 ≤ x ≤ k represents a parking spot assigned to car x (you can only move this car to this place), while the integer 0 represents a empty space (you can't move any car to this place).

In the second and third line, an integer 1 ≤ x ≤ k represents initial position of car x, while the integer 0 represents an empty space (you can move any car to this place).

Each x between 1 and k appears exactly once in the second and third line, and exactly once in the first and fourth line.

Output

If there is a sequence of moves that brings all of the cars to their parking spaces, with at most 20000 car moves, then print m, the number of moves, on the first line. On the following m lines, print the moves (one move per line) in the format i r c, which corresponds to Allen moving car i to the neighboring space at row r and column c.

If it is not possible for Allen to move all the cars to the correct spaces with at most 20000 car moves, print a single line with the integer -1.

Examples

Input

4 5
1 2 0 4
1 2 0 4
5 0 0 3
0 5 0 3


Output

6
1 1 1
2 1 2
4 1 4
3 4 4
5 3 2
5 4 2


Input

1 2
1
2
1
2


Output

-1


Input

1 2
1
1
2
2


Output

2
1 1 1
2 4 1

Note

In the first sample test case, all cars are in front of their spots except car 5, which is in front of the parking spot adjacent. The example shows the shortest possible sequence of moves, but any sequence of length at most 20000 will be accepted.

In the second sample test case, there is only one column, and the cars are in the wrong order, so no cars can move and the task is impossible.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 256;
const int INF = 1e9;
struct Move {
  int id, r, c;
};
int n, k, A[4][MAXN], r[MAXN], c[MAXN], gr[MAXN], gc[MAXN];
pair<int, int> padre[4][MAXN];
int dr[4] = {-1, 0, 1, 0};
int dc[4] = {0, 1, 0, -1};
bool stored[MAXN];
bool used[4][MAXN];
vector<Move> ans;
bool won() {
  for (int i = (0); i < (int)(k); i++) {
    if (!stored[i]) return false;
  }
  return true;
}
struct dot {
  int r, c;
};
void MOVE(int ff, int cc, int tf, int tc) {
  assert(A[tf][tc] == -1);
  assert(A[ff][cc] != -1);
  ans.push_back((Move){A[ff][cc], tf, tc});
  r[A[ff][cc]] = tf;
  c[A[ff][cc]] = tc;
  swap(A[ff][cc], A[tf][tc]);
}
bool sacameeeee(int f, int c, int nf, int nc) {
  queue<pair<int, int>> Q;
  Q.push({f, c});
  memset(used, false, sizeof(used));
  used[f][c] = true;
  while (!Q.empty()) {
    pair<int, int> v = Q.front();
    Q.pop();
    for (int i = (0); i < (int)(4); i++) {
      int rr = v.first + dr[i];
      int cc = v.second + dc[i];
      if (rr == nf && cc == nc) continue;
      if ((0 <= (rr) && (rr) < 4) && (0 <= (cc) && (cc) < n)) {
        if ((rr == 1 || rr == 2)) {
          if (used[rr][cc]) continue;
          if (A[rr][cc] == -1) {
            pair<int, int> s = {rr, cc};
            padre[rr][cc] = v;
            while (s != make_pair(f, c)) {
              pair<int, int> t = padre[s.first][s.second];
              MOVE(t.first, t.second, s.first, s.second);
              s = t;
            }
            return true;
          } else {
            used[rr][cc] = true;
            padre[rr][cc] = v;
            Q.push({rr, cc});
          }
        }
      }
    }
  }
  return false;
}
int main() {
  while (scanf("%d%d", &n, &k) >= 1) {
    memset(stored, false, sizeof(stored));
    ans.clear();
    for (int i = (0); i < (int)(4); i++) {
      for (int j = (0); j < (int)(n); j++) {
        scanf("%d", &A[i][j]);
        A[i][j]--;
        if (i == 1 || i == 2) {
          if (A[i][j] >= 0) {
            r[A[i][j]] = i;
            c[A[i][j]] = j;
          }
        } else {
          if (A[i][j] >= 0) {
            gr[A[i][j]] = i;
            gc[A[i][j]] = j;
          }
        }
      }
    }
    while (!won()) {
      bool possible = true;
      int d = INF, who = -1;
      for (int i = (0); i < (int)(k); i++) {
        if (!stored[i]) {
          int dd = abs(gr[i] - r[i]) + abs(gc[i] - c[i]);
          if (dd < d) {
            d = dd;
            who = i;
          }
        }
      }
      while (c[who] != gc[who]) {
        int dir = c[who] < gc[who] ? 1 : -1;
        int ff = r[who];
        int cc = c[who] + dir;
        if (A[ff][cc] == -1) {
          MOVE(r[who], c[who], ff, cc);
        } else {
          bool b = sacameeeee(ff, cc, r[who], c[who]);
          if (!b) {
            possible = false;
            break;
          }
        }
      }
      if (!possible) break;
      while (r[who] != gr[who]) {
        int dir = r[who] < gr[who] ? 1 : -1;
        int ff = r[who] + dir;
        int cc = c[who];
        if (ff == 0 || ff == 3) {
          stored[who] = true;
          A[r[who]][c[who]] = -1;
          ans.push_back((Move){who, ff, cc});
          break;
        }
        if (A[ff][cc] == -1) {
          MOVE(r[who], c[who], ff, cc);
        } else {
          bool b = sacameeeee(ff, cc, r[who], c[who]);
          if (!b) {
            possible = false;
            break;
          }
        }
      }
      if (!possible) break;
    }
    if (!won()) {
      puts("-1");
      continue;
    }
    assert(((int)ans.size()) <= 20000);
    printf("%d\n", ((int)ans.size()));
    for (int i = (0); i < (int)(((int)ans.size())); i++) {
      printf("%d %d %d\n", ans[i].id + 1, ans[i].r + 1, ans[i].c + 1);
    }
  }
  return 0;
}