#include <fstream>
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int *v[100001];
int dim[100001];
int viz[100001];
int dist[100001];
queue <int> q;
int start;
int n;
int m;

void adaugareNod(int x, int y)
{
    ++dim[x];

    if(v[x] == NULL)
        v[x] = (int *)malloc(sizeof(int));
    else
        v[x] = (int *)realloc(v[x], dim[x]);

    v[x][dim[x] - 1] = y;
}

void citire()
{
    f >> n >> m >> start;

    int x, y;
    for(int i = 0; i < m; ++i)
    {
        f >> x >> y;
        adaugareNod(x, y);
    }
}


void afisare()
{
        for(int i = 1; i <= n; ++i, cout << "end \n")
            for(int j = 0; j < dim[i]; ++j)
                cout << v[i][j] << " ";
}

void bfs()
{
    for(int i = 0; i <=n; ++i) dist[i] = -1;
    q.push(start);
    viz[start] = 1;
    int d = 1;
    dist[start] = 0;

    while(!q.empty())
    {
        int curent = q.front();
        q.pop();

        cout << curent << '\n';

        for(int i = 0; i < dim[curent]; ++i)
        {
            int nod = v[curent][i];
            if(!viz[nod])
            {
                viz[nod] = 1;
                dist[nod] = dist[curent] + 1;
                q.push(nod);
            }
        }
    }

}

void afis()
{
    for(int i = 1; i <= n; ++i)
    {
        if(dist[i] == 0 && i != start)
            g << '-1' << ' ';
        else
            g << dist[i] << ' ';
    }


    g << '\n';
}

int main()
{

    citire();
    afisare();
    bfs();
    afis();

    return 0;
}