#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector<int> a(n), b(n);
  REP(i, n) cin >> a[i];
  REP(i, n) cin >> b[i];
  array<vector<int>, 2> purchasers{};
  while (m--) {
    int t, c; cin >> t >> c;
    purchasers[t].emplace_back(c);
  }
  ranges::sort(purchasers[0], greater<int>());
  priority_queue<int> que;
  vector<int> ord(n);
  iota(ord.begin(), ord.end(), 0);
  ranges::sort(ord, {}, [&](const int i) -> int { return a[i]; });
  for (const int i : ord) {
    for (; !purchasers[0].empty() && a[i] > purchasers[0].back(); purchasers[0].pop_back()) {
      if (!que.empty()) que.pop();
    }
    que.emplace(b[i]);
  }
  for (; !purchasers[0].empty(); purchasers[0].pop_back()) {
    if (!que.empty()) que.pop();
  }
  vector<int> d;
  d.reserve(que.size());
  for (; !que.empty(); que.pop()) {
    d.emplace_back(que.top());
  }
  ranges::sort(purchasers[1], greater<int>());
  for (; !purchasers[1].empty(); purchasers[1].pop_back()) {
    if (!d.empty() && purchasers[1].back() >= d.back()) d.pop_back();
  }
  cout << d.size() << '\n';
  return 0;
}