#include<cstdio>

#include<queue>

#include<cctype>

#include<cstring>

#include<vector>

#include<algorithm>

using namespace std;

const int K=;

typedef double dl;

inline int read(){

    int X=,w=;char ch=;

    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}

    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();

    return w?-X:X;

}

struct point{//既是向量又是点

    int x;

    int y;

}q;

struct line{

    int u;

    int l;

}p[K];

int n,m,x1,y1,x2,y2,ans[K];

inline point getmag(point a,point b){

    point s;

    s.x=b.x-a.x;s.y=b.y-a.y;

    return s;

}

inline int multiX(point a,point b){

    return a.x*b.y-b.x*a.y;

}

int erfen(int l,int r){

    if(l==r)return l-;

    int mid=(l+r)>>;

    point a,b;

    a.x=p[mid].u;a.y=y1;

    b.x=p[mid].l;b.y=y2;

    if(multiX(getmag(q,a),getmag(q,b))<)return erfen(l,mid);

    return erfen(mid+,r);

}

int main(){

    bool first=;

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

    if(first)putchar('\n');

    first=;

    memset(ans,,sizeof(ans));

    int m=read();

    x1=read();y1=read();

    x2=read();y2=read();

    for(int i=;i<=n;i++){

        p[i].u=read();

        p[i].l=read();

    }

    for(int i=;i<=m;i++){

        q.x=read();

        q.y=read();

        ans[erfen(,n+)]++;

    }

    for(int i=;i<=n;i++){

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

    }

    }

    return ;

}