//#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <deque>


#define f first
#define s second
#define ll long long

using namespace std;

ifstream cin("eva.in");
ofstream cout ("eva.out");

deque < pair <ll,ll> > x;
deque < pair <ll,ll> > y;
vector < pair <ll,ll> > z;


bool metszi(ll a, ll b, ll c, ll d)
{
    if (c<b && a<=d)
        return true;
    else return false;
}

int i,n,k,l,mini,maxi,db;
int main()
{
    cin>>n>>k;
    x.resize(k+1);
    for(i=0; i<k; ++i)
    {
        cin>>x[i].f>>x[i].s;
    }
cin>>l;
    y.resize(l+1);
    for(i=0; i<l; ++i)
    {
        cin>>y[i].f>>y[i].s;
    }
    //for(i=0;i<y.size();++i)cout<<y[i].f<<" "<<y[i].s<<"\n";
    db=0;
    z.resize(l+k);
    while(!x.empty()&& !y.empty())
    {
        if(metszi(x[0].f,x[0].s,y[0].f,y[0].s))
        {
            db++;
            mini=min(x[0].s,y[0].s);
            maxi=max(x[0].f,y[0].f);
            z[db].f=maxi;
            z[db].s=mini;
        }

        if(x[0].s>y[0].s)y.pop_front();
        else x.pop_front();
    }
    cout<<db<<"\n";

    for(i=1;i<=db;++i)cout<<z[i].f<<" "<<z[i].s<<"\n";

    return 0;
}