#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int m[50][50],f[50],t1,t2,x,y,n,l,u,v,q;
void work(int w,int y)
{
	t1=min(w,y);
	t2=max(w,y);
	for(int i=1;i<=n;i++)
	{
		//printf("i=%d,m[t1][i]+m[i][t2]=%d,",i,m[t1][i]+m[i][t2]);
		 if(m[t1][i]+m[i][t2]==m[t1][t2])
		 {
		  printf("%d ",i);
	     }
	}
	return;
}
int main()
{
	freopen("geo.in","r",stdin);
	freopen("geo.out","w",stdout);
	scanf("%d%d",&n,&l);
	for(int i=1;i<=n;i++)
	 for(int j=1;j<=n;j++)
	  {
	  	if(i==j) m[i][j]=0;
	  	else m[i][j]=99999;
	  }
	for(int i=1;i<=l;i++)
	{
		scanf("%d%d",&x,&y);
		m[x][y]=1;
		m[y][x]=1;
	}
	for(int k=1;k<=n;k++)
	 for(int i=1;i<=n;i++)
	  for(int j=1;j<=n;j++)
	  {
	  	if(m[i][j]>m[i][k]+m[k][j]) m[i][j]=m[i][k]+m[k][j];
	  }
	scanf("%d",&q);
	for(int i=1;i<=q;i++)
	{
		scanf("%d%d",&v,&u);
		work(v,u);
	}
	return 0;
}