#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
void IOinit() {
	std::ios::sync_with_stdio(false), cin.tie(0);
#ifdef zqj
	freopen("1.in", "r", stdin);
#endif
}
int n, m;
using db = long double;
struct vec2 {
	db x, y;
	db norm() const { return x * x + y * y; }
} zero;
vec2 operator + (vec2 x, vec2 y) { return {x.x + y.x, x.y + y.y}; }
vec2 operator - (vec2 x, vec2 y) { return {x.x - y.x, x.y - y.y}; }
vec2 operator * (vec2 x, db y) { return {x.x * y, x.y * y}; }
db operator * (vec2 x, vec2 y) { return x.x * y.y - x.y * y.x; }
db operator % (vec2 x, vec2 y) { return x.x * y.x + x.y * y.y; }

const db eps = 1e-13;
db sgn(db x) {
	return x < -eps ? -1 : x > eps;
}
db eql(db x, db y) {
	return sgn(x - y) == 0;
}
db cross(vec2 x, vec2 y, vec2 z) {
	return (y - x) * (z - x);
}
std::vector<vec2> gethull(std::vector<vec2> o) {
	iter_swap(o.begin(), min_element(o.begin(), o.end(), [](vec2 x, vec2 y) {
		return eql(x.x, y.x) ? x.y < y.y : x.x < y.x;
	}));
	sort(o.begin() + 1, o.end(), [&](vec2 x, vec2 y) {
		db c = (x - o[0]) * (y - o[0]);
		if(fabs(c) > eps) return c > 0;
		return (x - o[0]).norm() < (y - o[0]).norm();
	});
	o.erase(remove_if(o.begin() + 1, o.end(), [&](vec2 x) {
		return sqrt((x - o[0]).norm()) < eps;
	}), o.end());
	std::vector<vec2> stack;
	for(vec2 x : o) {
		for(; stack.size() >= 2 && cross(stack.rbegin()[1], stack.back(), x) <= eps;) {
			stack.pop_back();
		}
		stack.push_back(x);
	}
	for(; stack.size() > 2 && cross(stack.rbegin()[1], stack.back(), o[0]) <= eps;) {
		stack.pop_back();
	}
	return stack; 
}
db findmax(vec2 d, const std :: vector <vec2> & a) {
	int l = 0, r = a.size() - 1; 
	if(a[0] % d > a.back() % d) {
		for( ; l + 1 < r; ) {
			int mid = (l + r) >> 1; 
			if(a[mid] % d > a[l] % d && a[mid] % d > a[mid - 1] % d) {
				l = mid; 
			} 
			else {
				r = mid; 
			}
		}
		return a[l] % d; 
	}
	else {
		for(; l + 1 < r; ) {
			int mid = (l + r) >> 1; 
			if(a[mid] % d > a[r] % d && a[mid] % d > a[mid + 1] % d) {
				r = mid; 
			}
			else {
				l = mid; 
			}
		}
		return a[r] % d; 
	}
}
const int N = 200005;
vec2 p[N];
vec2 v[N];

vec2 L[N], R[N];
db l[N], r[N];

db ans = 0;
void solve(int l, int r) {
	if(l + 1 == r) {
		int i = l;
		auto & l = ::l;
		auto & r = ::r;
		l[i] -= p[i] % v[i];
		r[i] -= p[i] % v[i];
		R[i] = p[i] + v[i] * r[i];
		L[i] = p[i] + v[i] * l[i];
		ans += r[i] - l[i];
		return ;
	}
	int mid = (l + r) >> 1;
	solve(mid, r);
	std::vector<vec2> o;
	for(int i = mid;i < r;++i) {
		o.push_back(L[i]);
		o.push_back(R[i]);
	}
	o = gethull(o);
	for(int i = l;i < mid;++i) {
		::r[i] = std::max(::r[i], findmax(v[i], o));
		::l[i] = std::min(::l[i], -findmax(zero-v[i], o));
	}
	solve(l, mid);
}

db get(char * c) {
	int x = 0, flg = 1;
	if(*c == '-') flg = -1, ++c;
	for(;*c && *c != '.';++c) x = x * 10 + (*c & 15);
	if(*c == '.') {
		double p = 0.1, sum = 0;
		for(;*++c;) {
			sum += p * (*c & 15);
			p *= 0.1;
		}
		return (sum + x) * flg;
	} else {
		return x * flg;
	}
}
vec2 get() {
	static char ch[100000];
	cin >> ch;
	db x = get(ch);
	cin >> ch;
	db y = get(ch);
	return {x, y};
}
int main() {
	IOinit();
	cin >> n >> m;
	for(int i = 0;i < n;++i) {
		p[i] = get();
		v[i] = get();
		v[i] = v[i] * (1 / std::sqrt(v[i].norm()));
	}
	std::vector<vec2> o(m);
	for(int i = 0;i < m;++i) {
		o[i] = get();
	}
	o = gethull(o);
	for(int i = 0;i < n;++i) {
		l[i] = r[i] = p[i] % v[i];
		r[i] = std::max(r[i], findmax(v[i], o));
		l[i] = std::min(l[i], -findmax(zero-v[i], o));
	}
	solve(0, n);
	printf("%.20Lf\n", ans);
}