#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, x, y, i, viz[100005], dist[100005];
vector <int> g[100005];
queue <int> q;

void bfs(int start)
{
    viz[start]=1;
    q.push(start);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto it:g[nod])
            if(!viz[it])
            {
                dist[it]=dist[nod]+1;
                viz[it]=1;
                q.push(it);
            }
    }
}
int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
    bfs(s);

    for(i=1;i<=n;i++)
        if(!viz[i])
            dist[i]=-1;
    for(i=1;i<=n;i++)
        fout<<dist[i]<<' ';

    return 0;
}