#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
int A[MAX_N], B[MAX_N], P[MAX_N];
int idx[MAX_N];

void solve() {
	cin >> N;
	rep(i, 0, N) cin >> A[i];
	rep(i, 0, N) cin >> B[i];
	rep(i, 0, N) {
		cin >> P[i]; P[i]--;
		idx[P[i]] = i;
	}
	rep(i, 0, N) {
		if(A[i] <= B[P[i]] && i != P[i]) {
			cout << -1 << "\n"; return;
		}
	}
	vi ord(N);
	vector<pi> ans;
	rep(i, 0, N) ord[i] = i;
	sort(all(ord), [&](int a, int b) { return A[a] < A[b]; });
	rep(q, 0, N) {
		int i = ord[q];
		if(i == P[i]) continue;
		int j = idx[i];
		idx[P[i]] = j;
		idx[P[j]] = i;
		swap(P[i], P[j]);
		ans.pb(pi(i + 1, j + 1));
	}
	cout << sz(ans) << "\n";
	rep(i, 0, sz(ans)) {
		cout << ans[i].fst << " " << ans[i].sec << "\n";
	}
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <string>
using namespace std;

#define debug(x) std::cerr << #x << '=' << x << '\n'

#define rep(a, b, c) for (int a = b; a <= c; a++)

typedef long long LL;
typedef unsigned long long ULL;

const int N = 212345;

int n, m;

void work_before(void) {
    for (int i = 1; i <= m + 1; i++) {
        printf("%d %d\n", i << 1, (i << 1) + 1);
    }
}

void work_after(void) {
    for (int i = 1; i <= n - m - 2; i++) {
        printf("%d %d\n", 1000000 + i * 2, 1000001 + i * 2);
    }
}

int main() {
    cin >> n >> m;
    if (n == 1 || n == 2) {
        if (!m) {
            puts("1 2");
        } else {
            puts("-1");
        }
        return 0;
    }

    if (m < 0 || n - m - 1 < 1) {
        puts("-1");
        return 0;
    }
    puts("1 1000001");
    work_before();
    work_after();
    return 0;
}