import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto H = RD;
	auto W = RD;
	auto N = RD;
	auto M = RD;
	auto T = new long[](N);
	auto U = new long[](N);
	auto L = new long[](N);
	auto R = new long[](N);
	auto A = new long[](N);
	foreach (i; 0..N)
	{
		T[i] = RD-1;
		U[i] = RD-1;
		L[i] = RD-1;
		R[i] = RD-1;
		A[i] = RD;
	}
	auto imos = new long[][](H+1, W+1);
	foreach (i; 0..M)
	{
		auto X = RD-1;
		auto Y = RD-1;
		auto B = RD;
		auto C = RD;
		auto t = max(0, X-B);
		auto b = min(H, X+B+1);
		auto l = max(0, Y-B);
		auto r = min(W, Y+B+1);
		imos[t][l] += C;
		imos[b][l] -= C;
		imos[t][r] -= C;
		imos[b][r] += C;
	}

	foreach (y; 0..H+1)
		foreach (x; 0..W)
			imos[y][x+1] += imos[y][x];
	foreach (x; 0..W+1)
		foreach (y; 0..H)
			imos[y+1][x] += imos[y][x];
	foreach (y; 0..H+1)
		foreach (x; 0..W)
			imos[y][x+1] += imos[y][x];
	foreach (x; 0..W+1)
		foreach (y; 0..H)
			imos[y+1][x] += imos[y][x];
	debug
	{
		foreach (e; imos)
			writeln(e);
	}

	long ans;
	foreach (i; 0..N)
	{
		auto d = imos[U[i]][R[i]];
		if (T[i] != 0)
			d -= imos[T[i]-1][R[i]];
		if (L[i] != 0)
			d -= imos[U[i]][L[i]-1];
		if (T[i] != 0 && L[i] != 0)
			d += imos[T[i]-1][L[i]-1];
		if (d < A[i])
			++ans;
		debug writeln("d:", d);
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}