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

typedef long long ll;
typedef pair<int, int> pii;

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

inline ll rd() {
    ll x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

constexpr int M = 507;
constexpr int N = 300007;

ll f[N];

int d[M], k[M], c[M], a[N], ptr[M];

int main() {
    memset(f, 0x3f, sizeof(f));
    int m = rd(), t = rd();
    d[0] = 1; k[0] = 1; c[0] = rd();
    rep(i, 1, m) {d[i] = rd(); k[i] = rd(); c[i] = rd();}
    int n = 0;
    rep(i, 1, t) {
        int x = rd(), cnt = rd();
        rep(j, 1, cnt) a[++n] = x;
    }
    f[0] = 0;
    rep(i, 0, m) ptr[i] = 1;
    rep(i, 1, n) {
        rep(j, 0, m) {
            while (i - ptr[j] + 1 > k[j] || a[i] - a[ptr[j]] + 1 > d[j]) ++ptr[j];
            f[i] = min(f[i], f[ptr[j] - 1] + c[j]);
        }
    }
    printf("%lld\n", f[n]);
    return 0;
}