#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
inline int read(){
	int x=0,f=1;char ch=getchar();
	for(;'0'>ch||ch>'9';ch=getchar())if(ch=='-')f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar())x=(x<<3)+(x<<1)+(ch^48);
	return x*f;
}
const int N=2e6,V=3e9;
struct xy{int x,y;void rd(){x=read();y=read();}}a[N],o,p,q;
xy operator-(xy a,xy b){return{a.x-b.x,a.y-b.y};}
int chr(xy a,xy b,xy c){a=a-c;b=b-c;return a.x*b.y-a.y*b.x;}
int id(xy a){if(a.x<0)a=o-a;if(a.y<0)a=o-a;int z=abs(__gcd(a.x,a.y));return a.x/z*V+a.y/z;}
unordered_map<int,int>mp;
#define F(x)(chr(p,q,a[x])*P)
inline int clc(int L,int R,int P){int M=(L+R)/2,x=F(M);return L>R?0:x<0?clc(M+1,R,P):x>0?clc(L,M-1,P):1;}
inline int ask(int L,int R,int P){
	int M=(L+R)/2,x=F(M),y=F(M+1),z=0;
	if(L+10>R)f(i,L,R)z+=!F(i);
	else if(x<y&&y<=0)z=ask(M,R,P);
	else if(y<x&&x<=0)z=ask(L,R,M);
	else z=clc(L,M,P)+clc(M+1,R,-P);
	return z;
}
signed main(){
	n=read();m=read();
	f(i,1,n)a[i].rd();
	f(_,1,m){
		if(read()<2){
			p.rd();mp.clear();s=0;
			f(i,1,n)s+=mp[id(p-a[i])]++;
			printf("%lld\n",s);
		}else{
			p.rd();q.rd();
			int P=1,L=1,R=n,M;
			g(i,2,1)if(F(i)>F(i+1))P=-P;
			for(;L<R;F(1)>F(M)?R=M-1:L=M)M=(L+R+1)/2;
			printf("%lld\n",F(1)>0?ask(L+1,n,-P):ask(1,R,P));
		}
	}
	return 0;
}