#include<bits/stdc++.h>

using namespace std;

int main(){
  int n;
  cin >> n;
  vector<int> a(n+1),b(n+1),p(n+1),ip(n+1);
  for(int i=1;i<=n;i++){cin >> a[i];} //hito
  for(int i=1;i<=n;i++){cin >> b[i];} //nimotsu
  for(int i=1;i<=n;i++){
    cin >> p[i];
    ip[p[i]]=i;
  }

  vector<pair<int,int>> pv;
  vector<pair<int,int>> nm;

  for(int i=1;i<=n;i++){
    nm.push_back(make_pair(b[i],i));
  }
  sort(nm.begin(),nm.end());
  for(int i=0;i<n;i++){
    int cn=nm[i].second;
    while(p[cn]!=cn){
      int fir=ip[cn];
      int sec=ip[fir];
      //cout << fir << ' ' << sec << '\n';
      if(a[fir]<=b[p[fir]] || a[sec]<=b[p[sec]]){break;}
      pv.push_back(make_pair(fir,sec));
      swap(p[fir],p[sec]);
      ip[p[fir]]=fir;
      ip[p[sec]]=sec;
    }
  }

  for(int i=1;i<=n;i++){
    if(i!=p[i]){
      cout << "-1\n";
      return 0;
    }
  }
  cout << pv.size() << '\n';
  for(auto &e : pv){
    cout << e.first << ' ' << e.second << '\n';
  }
}

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

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

struct edge{
    ll to, cost, shuki;
};

using Graph = V<V<edge>>;

int main(){

    ll N, M, X, Y;
    cin >> N >> M >> X >> Y;
    X--, Y--;
    V<ll> A(M), B(M), T(M), K(M);
    REP(i, M) cin >> A[i] >> B[i] >> T[i] >> K[i], A[i]--, B[i]--;

    Graph G(N);
    REP(i, M){
        G[A[i]].emplace_back(edge{B[i], T[i], K[i]});
        G[B[i]].emplace_back(edge{A[i], T[i], K[i]});
    }    

    vector<ll> dist(N, INF);    

    using Pi = pair< ll, int >;
    priority_queue< Pi, vector< Pi >, greater< Pi > > que;
    dist[X] = 0;
    que.emplace(dist[X], X);
    while(!que.empty()) {
        ll cost;
        int idx;
        tie(cost, idx) = que.top();
        que.pop();
        if(dist[idx] < cost) continue;
        for(auto &e : G[idx]) {
            auto next_cost = ((cost+e.shuki-1) / e.shuki)*e.shuki + e.cost;
            if(dist[e.to] <= next_cost) continue;
            dist[e.to] = next_cost;
            que.emplace(dist[e.to], e.to);
        }
    }

   //  dump(dist)

    cout << (dist[Y] == INF ? -1 : dist[Y]) << endl;

    return 0;
}