#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;


int n;
int a[maxn],b[maxn],p[maxn],pinv[maxn];


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    for (int i=1; i<=n; i++) {
	cin>>a[i];
    }
    for (int i=1; i<=n; i++) {
	cin>>b[i];
    }

    for (int i=1; i<=n; i++) {
	cin>>p[i];
	pinv[p[i]]=i;
    }

    for (int i=1; i<=n; i++) {
	if (i==p[i]) continue;
	if (a[i] > b[p[i]]) continue;
	out(-1);
    }


    vector<pair<int,int>> ans;

    vector<int> ord(n);
    iota(ord.begin(),ord.end(),1);
    sort(ord.begin(),ord.end(),[&](int i, int j) {
	return a[i]<a[j];
    });

    // a[i] > b[p[i]]
    // a[j] > b[p[j]]
    // a[i] <= a[j], implies b[p[i]] < b[p[j]]

    for (int i: ord) {
	if (i==p[i]) continue;
	int j = pinv[i];
	int tmpi = p[i];
	int tmpj = p[j];
	swap(p[i],p[j]);
	pinv[tmpj]=i;
	pinv[tmpi]=j;
	assert(i==p[i]);
	ans.emplace_back(i,j);
    }


    cout<<ans.size()<<endl;
    for (auto p: ans) cout<<p.first<<" "<<p.second<<"\n";
    
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

// template {{{
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

constexpr i32 mod   = 1e9 + 7;
// constexpr i32 mod   = 998244353;

constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; 
constexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? " " : ""); } return os; } 
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}

void solve() {
  int n = input();
  vector< int > as(n), bs(n), ps(n);
  cin >> as >> bs >> ps;

  for (auto &p : ps) p--;

  vector< int > used(n, false);

  bool valid = true;
  vector< pair< int, int > > ans;

  for (int v = 0; v < n; v++) {
    if (used[v]) continue;

    vector< int > us;
    us.emplace_back(v);
    used[v] = true;

    for (int u = ps[v]; u != v; u = ps[u]) {
      us.emplace_back(u);
      used[u] = true;
    }

    if ((int)us.size() == 1) continue;

    int min_b = inf;
    int idx_b = -1;

    for (int i = 0; i < (int)us.size(); i++) {
      int u = us[i];
      if (as[u] <= bs[ps[u]]) {
        valid = false;
      }

      if (bs[ps[u]] < min_b) {
        min_b = bs[ps[u]];
        idx_b = i;
      }
    }

    int sz = us.size();
    for (int i = (idx_b - 1 + sz) % sz; i != idx_b; i = (i - 1 + sz) % sz) {
      ans.emplace_back(us[i] + 1, us[(i + 1) % sz] + 1);
    }
  }

  if (not valid) {
    cout << -1 << endl;
    return;
  }

  cout << (int)ans.size() << endl;
  for (auto &t : ans) {
    cout << t.first << " " << t.second << endl;
  }
}

signed main() {
  solve();
}
