#include <bits/stdc++.h>
using namespace std;
template <class C>
void min_self(C &a, C b) {
  a = min(a, b);
}
template <class C>
void max_self(C &a, C b) {
  a = max(a, b);
}
long long mod(long long n, long long m = 1000000007) {
  n %= m, n += m, n %= m;
  return n;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
unordered_map<long long, int, custom_hash> safe_map;
const int MAXN = 2e5 + 5;
const int LOGN = 21;
const long long INF = 1e14;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
multiset<long long> in[MAXN], out[MAXN], cur;
vector<long long> cum(MAXN);
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m, k, t;
  cin >> m >> n >> k >> t;
  vector<long long> a(m);
  vector<long long> xx(n + 5, 0);
  for (int i = 0; i < m; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < k; i++) {
    long long l, r, d;
    cin >> l >> r >> d;
    in[l].insert(d);
    out[r + 1].insert(d);
  }
  sort(a.begin(), a.end());
  for (int i = 1; i <= n + 1; i++) {
    for (auto x : in[i]) cur.insert(x);
    for (auto x : out[i]) {
      auto lb = cur.find(x);
      if (lb != cur.end()) cur.erase(lb);
    }
    if (!cur.empty()) xx[i] = *(cur.rbegin());
  }
  for (int i = 0; i <= n + 1; i++) {
    cum[xx[i]]++;
  }
  for (int i = MAXN - 2; i >= 0; i--) {
    cum[i] += cum[i + 1];
  }
  long long ans = 0;
  for (int i = 0; i < m; i++) {
    long long now = a[i];
    long long people = m - i;
    long long time = 2 * cum[now + 1] + n + 1;
    if (time <= t) {
      ans = max(ans, people);
    }
  }
  cout << ans, cout << "\n";
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
