#include <iostream>

#include <cstring>

#include <algorithm>

#include <queue>

#include <cstdio>

#include <cstdlib>

#include <cctype>

#include <math.h>

#include <ctype.h>

using namespace std;

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

#define N 5500

typedef long long  ll;

struct node

{

    int x, y, v;

}p[N],u[N];

int y2;

int cmp(const void *a,const void *b)

{

    struct node *c, *f;

    c=(struct node *)a;

    f=(struct node *)b;

    return c->x-f->x;

}

int Find(int nx,int ny,int l,int r)

{

    if(l==r-)

        return l;

    int mid=(l+r)/;

    node d;

    d.x=nx-p[mid].v;

    d.y=ny-y2;

    if((d.x*p[mid].y)-(d.y*p[mid].x)>)

    {

        l=mid;

        r=r;

        return Find(nx,ny,l,r);

    }

    else if((d.x*p[mid].y)-(d.y*p[mid].x)<)

    {

        l=l;

        r=mid;

        return Find(nx,ny,l,r);

    }

    return ;

}

int main()

{

    int n,m,x1,x2,y1,a[N];

    while(scanf("%d",&n),n)

    {

        memset(a,);

        scanf("%d %d %d %d %d",&m,&x1,&y1,&x2,&y2);

        p[].x=x1;

        p[].y=y2;

        p[].v=x1;

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

        {

            scanf("%d %d",&u[i].x,&u[i].y);

        }

        qsort(u+,n,sizeof(u[]),cmp);

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

        {

            p[i].x=u[i].x-u[i].y;

            p[i].y=y1-y2;

            p[i].v=u[i].y;

        }

        p[n+].x=x2;

        p[n+].y=y1;

        p[n+].v=x2;

        int k,v;

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

        {

            scanf("%d %d",&k,&v);

            int aa=Find(k,v,,n+);

            a[aa]++;

        }

        int ans[N];

        memset(ans,);

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

        {

            if(a[i])

            {

                ans[a[i]]++;

            }

        }

        printf("Box\n");

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

        {

            if(ans[i])

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

        }

    }

    return ;

}