#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const 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 >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != 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 >
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); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

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

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


int main() {
  int N, Q;
  int64 L, R;
  cin >> N >> Q >> L >> R;
  vector< int64 > A(N);
  cin >> A;
  sort(begin(A), end(A));
  vector< int64 > a(Q), b(Q), c(Q), d(Q);
  for(int i = 0; i < Q; i++) {
    cin >> a[i] >> b[i] >> c[i] >> d[i];
  }
  __int128_t ok = A.back() + 1, ng = A.front() - 1;
  auto check1 = [&](__int128_t v) {
    for(int i = 0; i < Q; i++) {
      if(a[i] == 1) {
        if(v >= b[i]) v = d[i] * (v + c[i]);
      } else {
        if(v <= b[i]) v = (v - c[i]) / d[i];
      }
    }
    return L <= v;
  };
  while(ok - ng > 1) {
    auto md = (ok + ng) / 2;
    if(check1(md)) ok = md;
    else ng = md;
  }

  auto LLL = ok;

  ok = A.back() + 1, ng = A.front() - 1;
  swap(ok, ng);
  auto check2 = [&](__int128_t v) {
    for(int i = 0; i < Q; i++) {
      if(a[i] == 1) {
        if(v >= b[i]) v = d[i] * (v + c[i]);
      } else {
        if(v <= b[i]) v = (v - c[i]) / d[i];
      }
    }
    return v <= R;
  };
  while(ng - ok > 1) {
    auto md = (ok + ng) / 2;
    if(check2(md)) ok = md;
    else ng = md;
  }

  auto RRR = ok;
  cout << upper_bound(begin(A), end(A), RRR) - lower_bound(begin(A), end(A), LLL) << endl;

}




Measured memory_bytes: 10488