C. Tesla （模拟 + 思维）

#include <bits/stdc++.h>
#define LL long long
#define mem(i, j) memset(i, j, sizeof(i))
#define rep(i, j, k) for(int i = j; i <= k; i++)
#define dep(i, j, k) for(int i = k; i >= j; i--)
#define pb push_back
#define make make_pair
#define INF INT_MAX
#define inf LLONG_MAX
#define PI acos(-1)
using namespace std;

const int N = 1e6 + 5, mod = 1e9 + 7;

int nx[4] = {1, -1, 0, 0};
int ny[4] = {0, 0, 1, -1};

LL ksm(LL a, LL b) {
    LL ans = 1;
    while(b) {
        if(b & 1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}

int a[5][100];

pair < int, int >ans[N];
int id[N], tot, n, k;

bool judge() {
    rep(i, 1, n) {
        if(!a[2][i] || !a[3][i]) return true;
    }
    return false;
}

void stop() {
    rep(i, 1, n) {
        if(a[2][i] == a[1][i] && a[1][i] != 0) {
            ans[++tot] = make(1, i);
            id[tot] = a[2][i];
            a[2][i] = 0;
            k--;
        }
        if(a[3][i] == a[4][i] && a[3][i] != 0) {
            ans[++tot] = make(4, i);
            id[tot] = a[3][i];
            a[3][i] = 0;
            k--;
        }
    }
}

void trun(int x, int y) {
    int nowx = x, nowy = y;
    if(x == 2) {
        while(y < n) {
            y++;
            if(a[x][y]) {
                ans[++tot] = make(x, y - 1);
                id[tot] = a[x][y];
            }
            a[x][y - 1] = a[x][y];
        }
        x++;
        if(a[x][y]) {
            ans[++tot] = make(x - 1, y);
            id[tot] = a[x][y];
        }
        a[x - 1][y] = a[x][y];
        while(y > 1) {
            y--;
            if(a[x][y]) {
                ans[++tot] = make(x, y + 1);
                id[tot] = a[x][y];
            }
            a[x][y + 1] = a[x][y];
        }
        x--;

        if(x == nowx && y == nowy) return ;

        if(a[x][y]) {
            ans[++tot] = make(x + 1, y);
            id[tot] = a[x][y];
        }
        a[x + 1][y] = a[x][y];
        while(y < nowy - 1) {
            y++;
            if(a[x][y]) {
                ans[++tot] = make(x, y - 1);
                id[tot] = a[x][y];
            }
            a[x][y - 1] = a[x][y];
        }
    }
    else {
        while(y > 1) {
            y--;
            if(a[x][y]) {
                ans[++tot] = make(x, y + 1);
                id[tot] = a[x][y];
            }
            a[x][y + 1] = a[x][y];
        }
        x--;
        if(a[x][y]) {
            ans[++tot] = make(x + 1, y);
            id[tot] = a[x][y];
        }
        a[x + 1][y] = a[x][y];
        while(y < n) {
            y++;
            if(a[x][y]) {
                ans[++tot] = make(x, y - 1);
                id[tot] = a[x][y];
            }
            a[x][y - 1] = a[x][y];
        }
        x++;
        if(x == nowx && y == nowy) return ;
        if(a[x][y]) {
            ans[++tot] = make(x - 1, y);
            id[tot] = a[x][y];
        }
        a[x - 1][y] = a[x][y];
        while(y > nowy + 1) {
            y--;
            if(a[x][y]) {
                ans[++tot] = make(x, y + 1);
                id[tot] = a[x][y];
            }
            a[x][y + 1] = a[x][y];
        }
    }

}

void solve() {

    scanf("%d %d", &n, &k);

    rep(i, 1, 4) rep(j, 1, n) scanf("%d", &a[i][j]);

    stop();
    if(judge() == false) { puts("-1"); return ; }

    int x, y;
    rep(i, 1, n) {
        if(a[2][i] == 0) {
            x = 2; y = i; break;
        }
        if(a[3][i] == 0) {
            x = 3; y = i; break;
        }
    }

    while(k) {
        trun(x, y);
        stop();
        if(x == 3 && y == n) x = 2;
        else if(x == 2 && y == 1) x = 3;
        else if(x == 3) y++;
        else if(x == 2) y--;
    }

    printf("%d\n", tot);
    rep(i, 1, tot) printf("%d %d %d\n", id[i], ans[i].first, ans[i].second);

}


int main() {

    solve();


    return 0;
}