#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 typedef pair<int,int> PII;

 typedef pair<ll,ll> Pll;

 typedef vector<int> VI;

 typedef vector<PII> VII;

 //typedef pair<ll,ll>P;

 #define N  4100

 #define M  2000010

 #define fi first

 #define se second

 #define MP make_pair

 #define pb push_back

 #define pi acos(-1)

 #define mem(a,b) memset(a,b,sizeof(a))

 #define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)

 #define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)

 #define lowbit(x) x&(-x)

 #define Rand (rand()*(1<<16)+rand())

 #define id(x) ((x)<=B?(x):m-n/(x)+1)

 #define ls p<<1

 #define rs p<<1|1

 const ll MOD=1e9+,inv2=(MOD+)/;

       double eps=1e-;

       int INF=1e9;

       int dx[]={-,,,};

       int dy[]={,,-,};

 struct P

 {

     int x,y;

     P()=default;

     P(int x,int y):x(x),y(y){}

     P rot90(){return P(-y,x);} //逆时针转90度

     P _rot90(){return P(y,-x);} //顺时针转90度

 }p[N],t[N];

 bool operator^(P a,P b) //叉积

 {

     return (1ll*a.x*b.y-1ll*a.y*b.x)>;

 }

 int quadrant(P a)   //象限

 {

          if(a.x>&&a.y>=) return ;

     else if(a.x<=&&a.y>) return ;

     else if(a.x<&&a.y<=) return ;

     else if(a.x>=&&a.y<) return ;

 }

 bool operator<(P a,P b) //极角排序

 {

     int qa=quadrant(a),qb=quadrant(b);

     if(qa!=qb) return qa<qb;

     return a^b;

 }

 P operator-(P a,P b)

 {

     return P(a.x-b.x,a.y-b.y);

 }

 int ans[N],n,q;

 int read()

 {

    int v=,f=;

    char c=getchar();

    while(c<||<c) {if(c=='-') f=-; c=getchar();}

    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();

    return v*f;

 }

 void solve()

 {

     rep(i,,q) ans[i]=;

     int m=n+q;

     rep(i,n+,m)

     {

         int top=;

         rep(j,,n)

         {

             top++;

             t[top]=p[j]-p[i];

         }

         sort(t+,t+top+);

         rep(j,,n)

         {

             P tmp=t[j].rot90();

             int num=upper_bound(t+,t+top+,tmp)-lower_bound(t+,t+top+,tmp);

             ans[i-n]+=num;

         }

     }

     rep(i,,n)

     {

         int top=;

         rep(j,,n)

          if(j!=i)

          {

              top++;

              t[top]=p[j]-p[i];

          }

         sort(t+,t+top+);

         rep(j,n+,m)

         {

             P tmp=p[j]-p[i];

             P t1=tmp.rot90();

             ans[j-n]+=upper_bound(t+,t+top+,t1)-lower_bound(t+,t+top+,t1);

             P t2=tmp._rot90();

             ans[j-n]+=upper_bound(t+,t+top+,t2)-lower_bound(t+,t+top+,t2);

         }

     }

     rep(i,,q) printf("%d\n",ans[i]);

 }

 int main()

 {

     while(scanf("%d%d",&n,&q)!=EOF)

     {

         rep(i,,n+q) p[i].x=read(),p[i].y=read();

         solve();

     }

     return ;

 }