#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

int n, m ,s, dist[103000];
vector <int> graf[103000];
queue <int> q;

void initializare()
{
    for(int i=0; i<103000; i++)
        dist[i]=-1;
}

void parcurgere(int k)
{
    q.push(k);
    dist[k]=0;

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

        for(int i=0; i<graf[x].size(); i++)
        {
            if(dist[graf[x][i]]==-1)
            {
                dist[graf[x][i]]=dist[x]+1;
                q.push(graf[x][i]);
            }
        }
    }
}

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");

    initializare();

    in>>n>>m>>s;

    for(int i=1; i<=m; i++)
    {
        int a,b;
        in>>a>>b;

        graf[a].push_back(b);
    }

    parcurgere(s);

    for (int i=1; i<=n; i++)
        out<<dist[i]<<" ";
    return 0;
}