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

const int MaxN=100005;

using namespace std;

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

queue <int> q;
vector <int> G[MaxN];

int dist[MaxN];
bool used[MaxN];

void bfs(int source)
{
    used[source]=true;
    q.push(source);
    while(q.size())
    {
        int node=q.front();
        q.pop();
        for(int i=0; i<G[node].size(); ++i)
        {
            int nxt=G[node][i];
            if(!used[nxt])
            {
                used[nxt]=true;
                q.push(nxt);
                dist[nxt]=dist[node]+1;
            }
        }
    }
}

int main()
{
    int n,m,s,x,y;
    in>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        G[x].push_back(y);
    }
    bfs(s);
    for(int i=1; i<=n; i++)
    {
        if(used[i]==false)
            dist[i]=-1;
    }
    for(int i=1; i<=n; i++)out<<dist[i]<<' ';
    return 0;
}