/**
Ivo Karagyozov
*/
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
int n, p;
struct node
{
    int i, j;
};
int board[105][105], ind=0, par[105][105];
node potok[10005];
bool isInOneComponent(node s, node e, int num)
{
    queue<node> q;
    q.push(s);
    while(!q.empty())
    {
        int i=q.front().i, j=q.front().j;
        if(i==e.i && j==e.j)
        {
            par[s.i][s.j]=0;
            return true;
        }
        if(board[i][j]==0)board[i][j]=-2;
        node k;
        k.i=i;
        k.j=j;
        q.pop();
        if(i+1<n && (board[i+1][j]==0 || board[i+1][j]==num))
        {
            k.i++;
            q.push(k);
            par[k.i][k.j]=1;
        }
        k.i=i;
        if(j+1<n && (board[i][j+1]==0 || board[i][j+1]==num))
        {
            k.j++;
            q.push(k);
            par[k.i][k.j]=4;
        }
        k.j=j;
        if(i-1>=0 && (board[i-1][j]==0 || board[i-1][j]==num))
        {
            k.i--;
            q.push(k);
            par[k.i][k.j]=3;
        }
        k.i=i;
        if(j-1>=0 && (board[i][j-1]==0 || board[i][j-1]==num))
        {
            k.j--;
            q.push(k);
            par[k.i][k.j]=2;
        }
        k.j=j;
    }
    return false;
}
void bfs(node s, node e, int num)
{
    int i=e.i, j=e.j, ie=s.i, je=s.j;
    board[i][j]=num;
    potok[ind].i=i;
    potok[ind].j=j;
    ind++;
    while(i!=ie || j!=je)
    {
        if(par[i][j]==1)
        {
            if(j-1>=0 && board[i][j-1]==0 && board[i-1][j-1]==0 && par[i-1][j]!=4)
            {
                board[i][j-1]=num;
                potok[ind].i=i;
                potok[ind].j=j-1;
                ind++;
                if(j-2>=0 && board[i][j-2]==0 && board[i-1][j-2]==0)
                {
                    board[i][j-2]=num;
                    potok[ind].i=i;
                    potok[ind].j=j-2;
                    ind++;
                    if(j-3>=0 && board[i][j-3]==0 && board[i-1][j-3]==0)
                    {
                        board[i][j-3]=num;
                        potok[ind].i=i;
                        potok[ind].j=j-3;
                        ind++;
                        if(j-4>=0 && board[i][j-4]==0 && board[i-1][j-4]==0)
                        {
                            board[i][j-4]=num;
                            potok[ind].i=i;
                            potok[ind].j=j-4;
                            ind++;
                            board[i-1][j-4]=num;
                            potok[ind].i=i-1;
                            potok[ind].j=j-4;
                            ind++;
                        }
                        board[i-1][j-3]=num;
                        potok[ind].i=i-1;
                        potok[ind].j=j-3;
                        ind++;
                    }
                    board[i-1][j-2]=num;
                    potok[ind].i=i-1;
                    potok[ind].j=j-2;
                    ind++;
                }
                board[i-1][j-1]=num;
                potok[ind].i=i-1;
                potok[ind].j=j-1;
                ind++;
            }
            else if(j+1<n && board[i][j+1]==0 && board[i-1][j+1]==0 && par[i-1][j]!=2)
            {
                board[i][j+1]=num;
                potok[ind].i=i;
                potok[ind].j=j+1;
                ind++;
                if(j+2<n && board[i][j+2]==0 && board[i-1][j+2]==0)
                {
                    board[i][j+2]=num;
                    potok[ind].i=i;
                    potok[ind].j=j+2;
                    ind++;
                    if(j+3<n && board[i][j+3]==0 && board[i-1][j+3]==0)
                    {
                        board[i][j+3]=num;
                        potok[ind].i=i;
                        potok[ind].j=j+3;
                        ind++;
                        if(j+4<n && board[i][j+4]==0 && board[i-1][j+4]==0)
                        {
                            board[i][j+4]=num;
                            potok[ind].i=i;
                            potok[ind].j=j+4;
                            ind++;
                            board[i-1][j+4]=num;
                            potok[ind].i=i-1;
                            potok[ind].j=j+4;
                            ind++;
                        }
                        board[i-1][j+3]=num;
                        potok[ind].i=i-1;
                        potok[ind].j=j+3;
                        ind++;
                    }
                    board[i-1][j+2]=num;
                    potok[ind].i=i-1;
                    potok[ind].j=j+2;
                    ind++;
                }
                board[i-1][j+1]=num;
                potok[ind].i=i-1;
                potok[ind].j=j+1;
                ind++;
            }
            if(par[i-1][j]==0)
            {
                if(i-2>=0)
                {
                    if(j-1>=0 && board[i][j-1]==num && board[i-1][j-1]==num && board[i-2][j-1]==0 && board[i-2][j]==0)
                    {
                        board[i-2][j-1]=num;
                        potok[ind].i=i-2;
                        potok[ind].j=j-1;
                        ind++;
                        board[i-2][j]=num;
                        potok[ind].i=i-2;
                        potok[ind].j=j;
                        ind++;
                    }
                    else if(j+1<n && board[i][j+1]==num && board[i-1][j+1]==num && board[i-2][j+1]==0 && board[i-2][j]==0)
                    {
                        board[i-2][j+1]=num;
                        potok[ind].i=i-2;
                        potok[ind].j=j+1;
                        ind++;
                        board[i-2][j]=num;
                        potok[ind].i=i-2;
                        potok[ind].j=j;
                        ind++;
                    }
                }
            }
            i--;
        }
        else if(par[i][j]==2)
        {
            if(i-1>=0 && board[i-1][j]==0 && board[i-1][j+1]==0 && par[i][j+1]!=1)
            {
                board[i-1][j]=num;
                potok[ind].i=i-1;
                potok[ind].j=j;
                ind++;
                if(i-2>=0 && board[i-2][j]==0 && board[i-2][j+1]==0)
                {
                    board[i-2][j]=num;
                    potok[ind].i=i-2;
                    potok[ind].j=j;
                    ind++;
                    if(i-3>=0 && board[i-3][j]==0 && board[i-3][j+1]==0)
                    {
                        board[i-3][j]=num;
                        potok[ind].i=i-3;
                        potok[ind].j=j;
                        ind++;
                        if(i-4>=0 && board[i-4][j]==0 && board[i-4][j+1]==0)
                        {
                            board[i-4][j]=num;
                            potok[ind].i=i-4;
                            potok[ind].j=j;
                            ind++;
                            board[i-4][j+1]=num;
                            potok[ind].i=i-4;
                            potok[ind].j=j+1;
                            ind++;
                        }
                        board[i-3][j+1]=num;
                        potok[ind].i=i-3;
                        potok[ind].j=j+1;
                        ind++;
                    }
                    board[i-2][j+1]=num;
                    potok[ind].i=i-2;
                    potok[ind].j=j+1;
                    ind++;
                }
                board[i-1][j+1]=num;
                potok[ind].i=i-1;
                potok[ind].j=j+1;
                ind++;
            }
            else if(i+1<n && board[i+1][j]==0 && board[i+1][j+1]==0 && par[i][j+1]!=3)
            {
                board[i+1][j]=num;
                potok[ind].i=i+1;
                potok[ind].j=j;
                ind++;
                if(i+2<n && board[i+2][j]==0 && board[i+2][j+1]==0)
                {
                    board[i+2][j]=num;
                    potok[ind].i=i+2;
                    potok[ind].j=j;
                    ind++;
                    if(i+3<n && board[i+3][j]==0 && board[i+3][j+1]==0)
                    {
                        board[i+3][j]=num;
                        potok[ind].i=i+3;
                        potok[ind].j=j;
                        ind++;
                        if(i+4<n && board[i+4][j]==0 && board[i+4][j+1]==0)
                        {
                            board[i+4][j]=num;
                            potok[ind].i=i+4;
                            potok[ind].j=j;
                            ind++;
                            board[i+4][j+1]=num;
                            potok[ind].i=i+4;
                            potok[ind].j=j+1;
                            ind++;
                        }
                        board[i+3][j+1]=num;
                        potok[ind].i=i+3;
                        potok[ind].j=j+1;
                        ind++;
                    }
                    board[i+2][j+1]=num;
                    potok[ind].i=i+2;
                    potok[ind].j=j+1;
                    ind++;
                }
                board[i+1][j+1]=num;
                potok[ind].i=i+1;
                potok[ind].j=j+1;
                ind++;
            }
            if(par[i][j+1]==0)
            {
                if(j+2<n)
                {
                    if(i-1>=0 && board[i-1][j]==num && board[i-1][j+1]==num && board[i-1][j+2]==0 && board[i][j+2]==0)
                    {
                        board[i-1][j+2]=num;
                        potok[ind].i=i-1;
                        potok[ind].j=j+2;
                        ind++;
                        board[i][j+2]=num;
                        potok[ind].i=i;
                        potok[ind].j=j+2;
                        ind++;
                    }
                    else if(i+1<n && board[i+1][j]==num && board[i+1][j+1]==num && board[i+1][j+2]==0 && board[i][j+2]==0)
                    {
                        board[i+1][j+2]=num;
                        potok[ind].i=i+1;
                        potok[ind].j=j+2;
                        ind++;
                        board[i][j+2]=num;
                        potok[ind].i=i;
                        potok[ind].j=j+2;
                        ind++;
                    }
                }
            }
            j++;
        }
        else if(par[i][j]==3)
        {
            if(j-1>=0 && board[i][j-1]==0 && board[i+1][j-1]==0 && par[i+1][j]!=4)
            {
                board[i][j-1]=num;
                potok[ind].i=i;
                potok[ind].j=j-1;
                ind++;
                if(j-2>=0 && board[i][j-2]==0 && board[i+1][j-2]==0)
                {
                    board[i][j-2]=num;
                    potok[ind].i=i;
                    potok[ind].j=j-2;
                    ind++;
                    if(j-3>=0 && board[i][j-3]==0 && board[i+1][j-3]==0)
                    {
                        board[i][j-3]=num;
                        potok[ind].i=i;
                        potok[ind].j=j-3;
                        ind++;
                        if(j-4>=0 && board[i][j-4]==0 && board[i+1][j-4]==0)
                        {
                            board[i][j-4]=num;
                            potok[ind].i=i;
                            potok[ind].j=j-4;
                            ind++;
                            board[i+1][j-4]=num;
                            potok[ind].i=i+1;
                            potok[ind].j=j-4;
                            ind++;
                        }
                        board[i+1][j-3]=num;
                        potok[ind].i=i+1;
                        potok[ind].j=j-3;
                        ind++;
                    }
                    board[i+1][j-2]=num;
                    potok[ind].i=i+1;
                    potok[ind].j=j-2;
                    ind++;
                }
                board[i+1][j-1]=num;
                potok[ind].i=i+1;
                potok[ind].j=j-1;
                ind++;
            }
            else if(j+1<n && board[i][j+1]==0 && board[i+1][j+1]==0 && par[i+1][j]!=2)
            {
                board[i][j+1]=num;
                potok[ind].i=i;
                potok[ind].j=j+1;
                ind++;
                if(j+2<n && board[i][j+2]==0 && board[i+1][j+2]==0)
                {
                    board[i][j+2]=num;
                    potok[ind].i=i;
                    potok[ind].j=j+2;
                    ind++;
                    if(j+3<n && board[i][j+3]==0 && board[i+1][j+3]==0)
                    {
                        board[i][j+3]=num;
                        potok[ind].i=i;
                        potok[ind].j=j+3;
                        ind++;
                        if(j+4<n &&  board[i][j+4]==0 && board[i+1][j+4]==0)
                        {
                            board[i][j+4]=num;
                            potok[ind].i=i;
                            potok[ind].j=j+4;
                            ind++;
                            board[i+1][j+4]=num;
                            potok[ind].i=i+1;
                            potok[ind].j=j+4;
                            ind++;
                        }
                        board[i+1][j+3]=num;
                        potok[ind].i=i+1;
                        potok[ind].j=j+3;
                        ind++;
                    }
                    board[i+1][j+2]=num;
                    potok[ind].i=i+1;
                    potok[ind].j=j+2;
                    ind++;
                }
                board[i+1][j+1]=num;
                potok[ind].i=i+1;
                potok[ind].j=j+1;
                ind++;
            }
            if(par[i+1][j]==0)
            {
                if(i+2<n)
                {
                    if(j-1>=0 && board[i][j-1]==num && board[i+1][j-1]==num && board[i+2][j-1]==0 && board[i+2][j]==0)
                    {
                        board[i+2][j-1]=num;
                        potok[ind].i=i+2;
                        potok[ind].j=j-1;
                        ind++;
                        board[i+2][j]=num;
                        potok[ind].i=i+2;
                        potok[ind].j=j;
                        ind++;
                    }
                    else if(j+1<n && board[i][j+1]==num && board[i+1][j+1]==num && board[i+2][j+1]==0 && board[i+2][j]==0)
                    {
                        board[i+2][j+1]=num;
                        potok[ind].i=i+2;
                        potok[ind].j=j+1;
                        ind++;
                        board[i+2][j]=num;
                        potok[ind].i=i+2;
                        potok[ind].j=j;
                        ind++;
                    }
                }
            }
            i++;
        }
        else if(par[i][j]==4)
        {
            if(i-1>=0 && board[i-1][j]==0 && board[i-1][j-1]==0 && par[i][j-1]!=1)
            {
                board[i-1][j]=num;
                potok[ind].i=i-1;
                potok[ind].j=j;
                ind++;
                if(i-2>=0 && board[i-2][j]==0 && board[i-2][j-1]==0)
                {
                    board[i-2][j]=num;
                    potok[ind].i=i-2;
                    potok[ind].j=j;
                    ind++;
                    if(i-3>=0 && board[i-3][j]==0 && board[i-3][j-1]==0)
                    {
                        board[i-3][j]=num;
                        potok[ind].i=i-3;
                        potok[ind].j=j;
                        ind++;
                        if(i-4>=0 && board[i-4][j]==0 && board[i-4][j-1]==0)
                        {
                            board[i-4][j]=num;
                            potok[ind].i=i-4;
                            potok[ind].j=j;
                            ind++;
                            board[i-4][j-1]=num;
                            potok[ind].i=i-4;
                            potok[ind].j=j-1;
                            ind++;
                        }
                        board[i-3][j-1]=num;
                        potok[ind].i=i-3;
                        potok[ind].j=j-1;
                        ind++;
                    }
                    board[i-2][j-1]=num;
                    potok[ind].i=i-2;
                    potok[ind].j=j-1;
                    ind++;
                }
                board[i-1][j-1]=num;
                potok[ind].i=i-1;
                potok[ind].j=j-1;
                ind++;
            }
            else if(i+1<n && board[i+1][j]==0 && board[i+1][j-1]==0 && par[i][j-1]!=3)
            {
                board[i+1][j]=num;
                potok[ind].i=i+1;
                potok[ind].j=j;
                ind++;
                if(i+2<n && board[i+2][j]==0 && board[i+2][j-1]==0)
                {
                    board[i+2][j]=num;
                    potok[ind].i=i+2;
                    potok[ind].j=j;
                    ind++;
                    if(i+3<n && board[i+3][j]==0 && board[i+3][j-1]==0)
                    {
                        board[i+3][j]=num;
                        potok[ind].i=i+3;
                        potok[ind].j=j;
                        ind++;
                        if(i+4<n && board[i+4][j]==0 && board[i+4][j-1]==0)
                        {
                            board[i+4][j]=num;
                            potok[ind].i=i+4;
                            potok[ind].j=j;
                            ind++;
                            board[i+4][j-1]=num;
                            potok[ind].i=i+4;
                            potok[ind].j=j-1;
                            ind++;
                        }
                        board[i+3][j-1]=num;
                        potok[ind].i=i+3;
                        potok[ind].j=j-1;
                        ind++;
                    }
                    board[i+2][j-1]=num;
                    potok[ind].i=i+2;
                    potok[ind].j=j-1;
                    ind++;
                }
                board[i+1][j-1]=num;
                potok[ind].i=i+1;
                potok[ind].j=j-1;
                ind++;
            }
            if(par[i][j-1]==0)
            {
                if(j-2>=0)
                {
                    if(i-1>=0 && board[i-1][j]==num && board[i-1][j-1]==num && board[i-1][j-2]==0 && board[i][j-2]==0)
                    {
                        board[i-1][j-2]=num;
                        potok[ind].i=i-1;
                        potok[ind].j=j-2;
                        ind++;
                        board[i][j-2]=num;
                        potok[ind].i=i;
                        potok[ind].j=j-2;
                        ind++;
                    }
                    else if(i+1<n && board[i+1][j]==num && board[i+1][j-1]==num && board[i+1][j-2]==0 && board[i][j-2]==0)
                    {
                        board[i+1][j-2]=num;
                        potok[ind].i=i+1;
                        potok[ind].j=j-2;
                        ind++;
                        board[i][j-2]=num;
                        potok[ind].i=i;
                        potok[ind].j=j-2;
                        ind++;
                    }
                }
            }
            j--;
        }

        potok[ind].i=i;
        potok[ind].j=j;
        ind++;
        board[i][j]=num;
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    freopen ("flow.in", "r", stdin);
    freopen ("flow.out", "w" , stdout);
    int is[255], js[255], ie[255], je[255];
    cin>>n>>p;
    for(int i=0; i<p; i++)
    {
        cin>>is[i]>>js[i]>>ie[i]>>je[i];
        board[is[i]][js[i]]=i+1;
        board[ie[i]][je[i]]=i+1;
    }
    int b;
    cin>>b;
    for(int a=0; a<b; a++)
    {
        int i, j;
        cin>>i>>j;
        board[i][j]=-1;
    }
    for(int i=0; i<p; i++)
    {

        node s, e;
        s.i=is[i];
        s.j=js[i];
        e.i=ie[i];
        e.j=je[i];
        if(isInOneComponent(s, e, i+1))
        {
            for(int k=0; k<n; k++)
            {
                for(int j=0; j<n; j++)
                {
                    if(board[k][j]==-2)board[k][j]=0;
                }
            }
            ind=0;
            bfs(s, e, i+1);
            cout<<ind<<" ";
            for(int i=0; i<ind-1; i++)
            {
                cout<<potok[i].i<<" "<<potok[i].j<<" ";
            }
            cout<<potok[ind-1].i<<" "<<potok[ind-1].j<<endl;
        }
        else
        {
            for(int k=0; k<n; k++)
            {
                for(int j=0; j<n; j++)
                {
                    if(board[k][j]==-2)board[k][j]=0;
                }
            }
            cout<<0<<endl;
        }
    }
    return 0;
}