#include <bits/stdc++.h>
using namespace std;
vector<int> v[100001];
queue<int> q;
int dist[100001];
ifstream in("bfs.in");
ofstream out("bfs.out");
 void BFS(int nr)
{
    dist[nr]=1;
    q.push(nr);
    while(!q.empty())
    {
        nr=q.front();
        for(auto it:v[nr])
            if(!dist[it])
            {
                dist[it]=dist[nr]+1;
                q.push(it);
            }
        q.pop();
    }
}
    int main( )
{
    int n,m,i,x,y,s;
    in>>n>>m>>s;
    for(i=0;i<m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    BFS(s);
    for(i=1;i<=n;i++)
        out<<dist[i]-1<<" ";
    return 0;
}