#include <bits/stdc++.h>
using namespace std;
template <class A>
void rd(vector<A>& v);
template <class T>
void rd(T& x) {
  cin >> x;
}
template <class H, class... T>
void rd(H& h, T&... t) {
  rd(h);
  rd(t...);
}
template <class A>
void rd(vector<A>& x) {
  for (auto& a : x) rd(a);
}
template <class T>
bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
void __p(T a) {
  cout << a;
}
template <typename T, typename F>
void __p(pair<T, F> a) {
  cout << "{";
  __p(a.first);
  cout << ",";
  __p(a.second);
  cout << "}\n";
}
template <typename T>
void __p(std::vector<T> a) {
  cout << "{";
  for (auto it = a.begin(); it < a.end(); it++)
    __p(*it), cout << ",}\n"[it + 1 == a.end()];
}
template <typename T, typename... Arg>
void __p(T a1, Arg... a) {
  __p(a1);
  __p(a...);
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : ";
  __p(arg1);
  cout << "\n";
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  int64_t bracket = 0, i = 0;
  for (;; i++)
    if (names[i] == ',' && bracket == 0)
      break;
    else if (names[i] == '(')
      bracket++;
    else if (names[i] == ')')
      bracket--;
  const char* comma = names + i;
  cout.write(names, comma - names) << " : ";
  __p(arg1);
  cout << " | ";
  __f(comma + 1, args...);
}
void setIO(string s = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin.exceptions(cin.failbit);
  if (((int64_t)(s).size())) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
const int64_t inf = 1e18;
signed main() {
  setIO();
  int64_t n, m, k, s;
  rd(n, m, k, s);
  vector<int64_t> a(n), b(n);
  rd(a, b);
  vector<int64_t> t(m), c(m);
  for (int64_t i = int64_t(0); i < int64_t(m); ++i) rd(t[i], c[i]);
  auto chk = [&](int64_t x, bool get = false) {
    int64_t mina = inf, minb = inf, minia = -1, minib = -1;
    for (int64_t i = int64_t(0); i < int64_t(x + 1); ++i) {
      if (ckmin(mina, a[i])) minia = i;
      if (ckmin(minb, b[i])) minib = i;
    }
    vector<pair<int64_t, int64_t>> cost, ans;
    for (int64_t i = int64_t(0); i < int64_t(m); ++i) {
      if (t[i] & 1)
        cost.push_back({mina * c[i], i});
      else
        cost.push_back({minb * c[i], i});
    }
    sort((cost).begin(), (cost).end());
    int64_t total = 0;
    for (int64_t i = int64_t(0); i < int64_t(k); ++i) {
      total += cost[i].first;
      ans.push_back({cost[i].second, t[cost[i].second] & 1 ? minia : minib});
    }
    if (get) {
      assert(total <= s);
      for (int64_t i = int64_t(0); i < int64_t(k); ++i)
        cout << ans[i].first + 1 << ' ' << ans[i].second + 1 << "\n";
      exit(0);
    }
    return total <= s;
  };
  if (!chk(n - 1)) {
    cout << "-1";
    exit(0);
  }
  if (chk(0)) {
    cout << 1 << "\n";
    chk(0, true);
  }
  int64_t lo = 0, hi = n - 1;
  while (hi - lo > 1) {
    int64_t mid = (hi + lo) / 2;
    chk(mid) ? hi = mid : lo = mid;
  }
  cout << hi + 1 << "\n";
  chk(hi, true);
}
