#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;

#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 int rd() {
	int 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 N = 100007;
constexpr double eps = 1e-10;
constexpr double PI = 3.1415926535897932384626433832795;

int n, q, ans[N], X[N], Y[N], x[N], y[N];

struct BIT {
	int c[N];
	inline void clear() {memset(c, 0, sizeof(c));}
	inline int lowbit(int x) {return x & (-x);}
	inline void add(int x) {
		for (; x < N; x += lowbit(x)) ++c[x];
	}
	inline int sum(int x) {
		int ret = 0;
		for (; x; x -= lowbit(x)) ret += c[x];
		return ret;
	}
} bit;

inline void work() {
	int l = rd(), r = rd();
	double a = cos(r * PI / 180);
	double b = -sin(r * PI / 180);
	double c = cos(l * PI / 180);
	double d = -sin(l * PI / 180);

	vector<tii> pts;
	vector<pair<double, int>> tmp;
	if (l == r) {
		if (l == 90) {
			rep(i, 1, n) pts.eb(X[i], Y[i], i);
			sort(all(pts));
			reverse(all(pts));
			int lstx = -1e9;
			for (auto [x, y, id] : pts) {
				if (x != lstx) {lstx = x; continue;}
				++ans[id];
			}
			return;
		}
		rep(i, 1, n) tmp.eb(Y[i] - b * X[i] / a, i);
		sort(all(tmp)); 
		double lst = -1e18;
		int cnt = 0;
		for (auto [w, id] : tmp) {
			if (abs(w - lst) > eps) ++cnt;
			x[id] = cnt;
			lst = w;
		}
		rep(i, 1, n) pts.eb(x[i], Y[i], i);
		sort(all(pts));
		reverse(all(pts));
		int lstx = -1e9;
		for (auto [x, y, id] : pts) {
			if (x != lstx) {lstx = x; continue;}
			++ans[id];
		}
		return;
	}
	
	rep(i, 1, n) tmp.eb((c * Y[i] - d * X[i]) / (b * c - a * d), i);
	sort(all(tmp)); 
	double lst = -1e18;
	int cnt = 0;
	for (auto [w, id] : tmp) {
		if (abs(w - lst) > eps) ++cnt;
		x[id] = cnt;
		lst = w;
	}
	tmp.clear();
	rep(i, 1, n) tmp.eb((a * Y[i] - b * X[i]) / (a * d - b * c), i);
	sort(all(tmp)); 
	lst = -1e18;
	cnt = 0;
	for (auto [w, id] : tmp) {
		if (abs(w - lst) > eps) ++cnt;
		y[id] = cnt;
		lst = w;
	}
	rep(i, 1, n) pts.eb(x[i], y[i], i);
	sort(all(pts));

	bit.clear();
	for (auto [x, y, id] : pts) {
		if (bit.sum(y)) ++ans[id];
		bit.add(y);
	}
}

int main() {
	n = rd(), q = rd();
	rep(i, 1, n) X[i] = rd(), Y[i] = rd();
	rep(i, 1, q) work();
	rep(i, 1, n) printf("%d ", ans[i]);
	return 0;
}