#include <iostream>
#include <fstream>
#include <cstdlib>
#include <vector>
#include <queue>
using namespace std;

#define PMax 255
#define NMax 105
#define MaxWays 1000000

struct line
{
    int x1,y1,x2,y2;
} coor[PMax];

struct pole
{
    int x,y;
};

int n,p,tox,toy;
int b,x,y;
int table[NMax][NMax];

vector<pole> way;

pole make(int x,int y)
{
    pole p;
    p.x=x,p.y=y;
    return p;
}
int length;
bool nach,endd=0,notpr=1;

void dfs(int i,int j)
{
    if(endd==1)return;
    if(i==tox&&j==toy)
    {
        endd=1;
        notpr=0;
        cout<<way.size();
        for(int j=0;j<way.size();j++)
            cout<<" "<<way[j].x<<" "<<way[j].y;
        cout<<endl;
        way.clear();
        return ;
    }
    if(i<0||j<0||i>=n||j>=n)return ;
    if(!nach&&table[i][j]!=0)return ;
    way.push_back(make(i,j));
    length++;
    nach=0;
    table[i][j]=length;
    /**for(int r=0;r<n;r++)
        {
            for(int c=0;c<n;c++)
            {if(table[r][c]<0)cout<<table[r][c]<<" ";
             else cout<<" "<<table[r][c]<<" ";}
            cout<<endl;
        }
        system("PAUSE");*/
    /**for(int i=0;i<way.size();i++)
        cout<<way[i].x<<" "<<way[i].y<<"  ";
    cout<<endl;
    system("PAUSE");*/

    dfs(i-1,j);
    if(i-1>=0&&i-1<n&&j>=0&&j<n&&table[i-1][j]==length)
        length--,table[i-1][j]=0,way.erase(way.begin()+way.size()-1,way.begin()+way.size());
    dfs(i,j-1);
    if(i>=0&&i<n&&j-1>=0&&j-1<n&&table[i][j-1]==length)
        length--,table[i][j-1]=0,way.erase(way.begin()+way.size()-1,way.begin()+way.size());
    dfs(i,j+1);
    if(i>=0&&i<n&&j+1>=0&&j+1<n&&table[i][j+1]==length)
        length--,table[i][j+1]=0,way.erase(way.begin()+way.size()-1,way.begin()+way.size());
    dfs(i+1,j);
    if(i+1>=0&&i+1<n&&j>=0&&j<n&&table[i+1][j]==length)
        length--,table[i+1][j]=0,way.erase(way.begin()+way.size()-1,way.begin()+way.size());
}

int main()
{
    freopen("flow.in","r",stdin);
    freopen("flow.out","w",stdout);
    ///ios_base::sync_with_stdio(false);
    ///cin.tie(NULL);

    cin>>n>>p;
    for(int i=0;i<p;i++)
    {
        cin>>coor[i].x1>>coor[i].y1>>coor[i].x2>>coor[i].y2;
        table[coor[i].x1][coor[i].y1]=-2;
        table[coor[i].x2][coor[i].y2]=-2;
    }
    cin>>b;
    for(int i=0;i<b;i++)
    {
        cin>>x>>y;
        table[x][y]=-1;
    }
    for(int i=0;i<p;i++)
    {
        nach=1;
        notpr=1;
        tox=coor[i].x2,toy=coor[i].y2;
        dfs(coor[i].x1,coor[i].y1);
        if(notpr==1)cout<<0<<endl;
    }
    return 0;
}
/**
6 4
2 5 5 1
1 2 3 4
5 4 3 5
3 0 0 5
5
4 0
3 3
5 0
1 3
2 1
*/