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

using namespace std;

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

const int INF = 1e9;

vector<int> G[100001];
queue<int> C;
int viz[100001];
int d[100001];

void BFS(int x)
{
    viz[x]=1;
    C.push(x);
    while(!C.empty())
    {
        int nod = C.front();
        C.pop();
        for(auto next:G[nod])
        {
            if(viz[next]==0)
            {
                C.push(next);
                d[next]=d[nod]+1;
            }
        }
    }

}

int main()
{
    int n, m, s;
    in>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x, y;
        in>>x>>y;
        G[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        viz[i]=0;
        d[i]=INF;
    }
    d[s]=0;
    BFS(s);
    for(int i=1;i<=n;i++)
    {
        if(d[i]==INF)
            out<<-1<<" ";
        else
            out<<d[i]<<" ";
    }
    return 0;
}