#include <bits/stdc++.h>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m, s, p[100005];
vector <int>g[100005];
queue <int>q;


void citire()
{
    int x, y;
    fin >> n >> m >> s;
    for(int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        g[x].push_back(y);
    }
}

void init()
{
    for(int i = 1; i <= n; ++i)
        p[i] = -1;
}

void bfs(int nod)
{

    cout << nod << " ";
    q.push(nod);
    p[nod]=0;
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(int i=0; i<g[nod].size(); i++)
        {
            if(p[g[nod][i]]==-1)
            {
                cout << g[nod][i] << " ";
                p[g[nod][i]]=p[nod]+1;
                q.push(g[nod][i]);
            }

        }
    }
}

void afisare()
{
    for(int i = 1; i <= n; i++)
        fout << p[i] << ' ';
}

int main()
{
    citire();
    init();
    bfs(s);

    afisare();
    return 0;
}