#include <bits/stdc++.h>

#define inf 0x3f3f3f3f
#define g_max 100010
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");


int dist[g_max];
vector < int > G[g_max];
queue < pair <int,int> > q;

int main()
{
    int n,m,s;
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
    }

    memset(dist, 0x3f, sizeof(dist));

    q.push({s,0});

    while(!q.empty())
    {
        int nod = q.front().first;
        int d = q.front().second;
        q.pop();

        if(dist[nod] != inf )
            continue;
        dist[nod] = d;

        for(int i=0;i<G[nod].size();i++)
            q.push({G[nod][i], d + 1});
    }
    for(int i=1;i<=n;i++)
    {
        if(dist[i] == inf)
            g<<-1<<' ';
        else
            g<<dist[i]<<' ';
    }
    return 0;
}