#include<fstream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<deque>
#include<queue>
#include<set>
#include<ctime>
#include<cstdio>
#include<map>
#include<unordered_map>
#include<stack>
#define x first
#define y second
#define pb push_back
using namespace std;
ifstream fin("poligon.in");
ofstream fout("poligon.out");
const int DN=60005,DM=805;
int n,m,lf,lg,f,g,nr;
unsigned short s[DN][DM];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        lf=f;
        lg=g;
        fin>>f>>g;
        if(i==1)
            continue;
        for(int j=min(lf,f);j<=max(lf,f);j++)
        {
            s[j][0]++;
            s[j][s[j][0]]=rand();
        }
    }
    for(int i=1;i<=m;i++)
        fin>>f>>g;
}