#include <bits/stdc++.h>

using namespace std;
int n,a,e,L[100000001],m;
struct Bencu {
 int M1;
 int M2;
}M[25000001];

int main()
{
    ifstream f("be.in");
    cin>>n>>a;
    for (int i=1; i<=a; i++) {
        int x,y;
        cin>>x>>y;
        for (int j=x; j<y; j++) L[j]++;
    }
    cin>>e;
    for (int i=1; i<=e; i++) {
        int x,y;
        cin>>x>>y;
        for (int j=x; j<y; j++) L[j]++;
    }
    for (int i=1; i<=n; i++) {
        if (L[i]==2) {
            m++;
            M[m].M1=i;
            while (L[i]==2 && i<=n) i++;
            M[m].M2=i;
        }
    }
    cout<<m<<endl;
    for (int i=1; i<=m; i++) cout<<M[i].M1<<" "<<M[i].M2<<endl;
    return 0;
}