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

#include  <ext/pb_ds/assoc_container.hpp>
#include  <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define int ll

typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<long long, long long> pll;
typedef vector<pair<int, int> > vpii;
typedef vector<pair<long long, long long> > vpll;
typedef set<int> si;
typedef set<long long> sll;
typedef map<int, int> mii;
typedef map<long long, long long> mll;

#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

constexpr int INF = 1e9 + 47;
constexpr long long LINF = (ll) 1e18 + 4747;
constexpr int MOD = 998244353;
constexpr int N = 1e5 + 47;

int solve()
{
	int d, t, c, r;
	if (!(cin >> d >> t >> c >> r))
		return 1;
	
	vector<pair<pair<int, bool>, db>> events;
	FOR (i, 0, c)
	{
		int s, e, a;
		db pr;
		cin >> s >> e >> pr >> a;
		events.PB(MP(MP(s, false), a * pr));
		events.PB(MP(MP(e, true), a * pr));
	}
	vector<bool> roof(d + 1);
	FOR (i, 0, r)
	{
		int st, eee;
		cin >> st >> eee;
		FOR (j, st, eee)
			roof[j] = 1;
	}
	
	sort(ALL(events));
	
	vd exp(t + 1);
	int idx = 0;
	db curr = 0;
	FOR (i, 0, t + 1)
	{
		while (idx < SZ(events) && events[idx].F.F == i)
		{
			//cout << "-_-\n";
			if (!events[idx].F.S)
				curr += events[idx].S;
			else
				curr -= events[idx].S;
			idx++;
		}
		//cout << curr << '\n';
		exp[i] = curr;
	}
	vd pexp(t + 2);
	FOR (i, 1, t + 2)
		pexp[i] = pexp[i - 1] + exp[i - 1];
	
	vector dp(d + 1, vd(t + 1, LINF));
	FOR (i, 0, t + 1)
		dp[0][i] = 0;
		
	//FOR (i, 0, t + 1)
		//cout << exp[i] << ' ';
	//cout << '\n';
		
	FOR (i, 1, d + 1)
	{
		FOR (j, i, t + 1)
		{
			//cout << roof[i] << '\n';
			if (roof[i])
			{
				dp[i][j] = min(dp[i][j - 1], dp[i - 1][j - 1] + exp[j - 1]);
				if (roof[i - 1])
					dp[i][j] = min(dp[i][j - 1], dp[i - 1][j - 1]);
			}
			else
			{
				dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + exp[j - 1]);
				if (roof[i - 1])
					dp[i][j] = min(dp[i][j], dp[i - 1][j - 1]);
			}
				
			//cout << "exp = " << exp[j] << '\n';
			//cout << "i = " << i << " j = " << j << " dp = " << dp[i][j] << '\n';
		}
	}
	
	cout << fixed << setprecision(6) << dp[d][t] << '\n';
	
	return 0;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif

    return 0;
}