#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
using namespace std;
using namespace __gnu_pbds;
const int N = 500005;
int n, q, x[N], y[N], id[N], X1, Y1, X2, Y2;
gp_hash_table <int, int> mp;
int calc(int x, int y){
	int ans = 1;
	if(x < 0) x = -x, ans = -ans;
	if(y < 0) y = -y, ans = -ans;
	int g = __gcd(x, y); x /= g, y /= g;
	return (x * (int)3e9 + y) * ans;
}
int crs(int id){ return (X1 - x[id]) * (Y2 - y[id]) - (X2 - x[id]) * (Y1 - y[id]);}
int cal(int l, int r, int cof){
	int ans = 0, mid = l + r >> 1;
	if(r - l <= 2) for(int i = l; i <= r; i++) ans += !crs(i);
	else if(crs(mid) * cof < 0) ans = cal(mid + 1, r, cof);
	else ans = cal(l, mid, cof); return ans;
}
int slv(int l, int r, int cof){
	int L = l, R = r, id = l;
	while(L + 3 < R){
		int mid = L + R >> 1, p1 = crs(mid) * cof, p2 = crs(mid + 1) * cof;
		if(p1 < p2) L = mid + 1;
		else R = mid;
	} for(int i = L; i <= R; i++) if(crs(i) * cof > crs(id) * cof) id = i;
	return cal(l, id, cof) + cal(id + 1, r, -cof);
}
signed main(){
	cin >> n >> q;
	for(int i = 1; i <= n; i++) cin >> x[i] >> y[i];
	while(q--){
		int t, ans = 0;
		cin >> t >> X1 >> Y1;
		if(t == 1){
			mp.clear();
			for(int i = 1; i <= n; i++) ans += mp[calc(x[i] - X1, y[i] - Y1)]++;
			cout << ans << '\n';
		} else{
			cin >> X2 >> Y2; int cof = 1;
			if(crs(2) < crs(1)) cof = -1;
			int l = 1, r = n;
			while(l < r){
				int mid = l + r + 1 >> 1;
				if(crs(1) * cof > crs(mid) * cof) r = mid - 1;
				else l = mid;
			}
			cout << slv(1, l, cof) + slv(l + 1, n, -cof) << '\n';
		}
	}
	return 0;
}