#include <cstdio>
#include <vector>
#include <queue>
#define LMAX 100005
#define INF 999999999

using namespace std;
FILE *fin=fopen("bfs.in","r");
FILE *fout=fopen("bfs.out","w");

vector <int> G[LMAX];

queue<int> Q;

int n, start;
int parcurs[LMAX];

void citire();
void BFS(int start);
void afisare();

int main()
{
citire();
BFS(start);
afisare();
fclose(fin);
fclose(fout);
return 0;
}

void BFS(int start)
    {

    }

void afisare()
    {

    }

void citire()
    {
     int i;
     int x, y;
     int m;
     fscanf(fin,"%d %d %d",&n,&m,&start);
     for (i=1;i<=m;i++)
         {
          fscanf(fin,"%d %d",&x, &y);
          G[x].push_back(y);
         }
    }