#pragma GCC optimize("Ofast","unroll-all-loops","fast-math")
#include <bits/stdc++.h>
using namespace std;
#define SZ 200999
typedef pair<int,int> pii;
#define sz(u) (int((u).size()))
#define x first
#define fi first
#define se second
#define y second
typedef long double ld;
typedef long long ll;
struct Line {
mutable ll k,m; mutable ld p; int u;
bool operator < (const Line&o) const {return k<o.k;}
bool operator < (ld s) const {return p<s;}
};
struct LC: multiset<Line,less<>> {
    static constexpr ld inf=1e2333;
    bool isect(iterator x,iterator y) {
        if(y==end()) return x->p=inf,0;
        if(x->k==y->k) x->p=x->m>y->m?inf:-inf;
        else x->p=ld(y->m-x->m)/(x->k-y->k);
        return x->p>=y->p;
    };
    void add(ll k,ll m,int i) {
        auto z=insert({k,m,0,i}),y=z++,x=y;
        while(isect(y,z)) z=erase(z);
        if(x!=begin()&&isect(--x,y)) isect(x,y=erase(y));
        while((y=x)!=begin()&&(--x)->p>=y->p)
            isect(x,erase(y));
    }
    int query(ld x) {
        assert(!empty());
        auto l=*lower_bound(x);
        return l.u;
    }
}A,B;
int n,q; pii s[SZ];
ll h[SZ];
ll easy(pii t) {
    unordered_map<ll,int> ss;
    ll ans=0;
    for(int i=0;i<n;++i) {
        pii w(s[i].fi-t.fi,s[i].se-t.se);
        ll g=__gcd(w.fi,w.se);
        w.fi/=g,w.se/=g;
        if(w.fi<0) w.fi*=-1,w.se*=-1;
        if(w.se<0) w.fi*=-1,w.se*=-1;
        h[i]=(w.fi+ll(2.01e9))*ll(4e9)+w.se;
        ans+=ss[h[i]]++;
    }
    return ans;
}
int main() {
    scanf("%d%d",&n,&q);
    for(int i=0;i<n;++i)
        scanf("%d%d",&s[i].fi,&s[i].se),
        A.add(s[i].fi,s[i].se,i),
        B.add(-s[i].fi,-s[i].se,i);
    int u=min_element(s,s+n)-s,v=max_element(s,s+n)-s;
    while(q--) {
        int o; pii a,b;
        scanf("%d%d%d",&o,&a.fi,&a.se);
        if(o==1) {
            printf("%lld\n",easy(a));
            continue;
        }
        scanf("%d%d",&b.fi,&b.se);
        int MI=-1,MX=-1;
        ll mi=8e18,mx=-8e18;
        pii S(b.se-a.se,a.fi-b.fi);
        auto qry=[&](pii t) {
            return S.fi*(ll)t.fi+S.se*(ll)t.se;
        };
        auto upd=[&](int s) {
            s=(s-5)%n; if(s<0) s+=n;
            for(int w=0;w<10;++w) {
                int v=(s+w)%n;
                ll dp=qry(::s[v]);
                if(MI==-1||mi>dp) mi=dp, MI=v;
                if(MX==-1||mx<dp) mx=dp, MX=v;
            }
        };
        upd(u); upd(v);
        if(S.se)
        upd(A.query(ld(S.fi)/S.se)),
        upd(B.query(ld(S.fi)/S.se));
        ll FD = qry(a);
        unordered_set<int> ans;
        // find where it >= FD
        {
        int L=MX,R=MI;
        if(L>R) R+=n;
        while(L<R) {
            int M=(L+R+1)>>1;
            if(qry(::s[M%n])>=FD) L=M;
            else R=M-1;
        }
        for(int s=L-3;s<=L+3;++s) {
            int p=(s%n+n)%n;
            if(qry(::s[p])==FD) ans.insert(p);
        }
        }
        {
        int L=MI,R=MX;
        if(L>R) R+=n;
        while(L<R) {
            int M=(L+R+1)>>1;
            if(qry(::s[M%n])<=FD) L=M;
            else R=M-1;
        }
        for(int s=L-3;s<=L+3;++s) {
            int p=(s%n+n)%n;
            if(qry(::s[p])==FD) ans.insert(p);
        }
        }
        printf("%d\n",int(ans.size()));
    }
}
/*
 5 3
 0 0
 2 0
 2 1
 1 2
 0 2
 2 1 1 2 2
*/