#include <fstream>
#include <climits>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
const int lim=1e5+3;
vector<int> vec[lim];
int dist[lim],n,m,s,x,y;
queue<int> q;
bool ok[lim];
int main()
{
    cin>>n>>m>>s;
    for(int i=1;i<=m;++i)
    {
        cin>>x>>y;
        vec[x].push_back(y);
    }
    for(int i=1;i<=n;++i)
        dist[i]=INT_MAX;
    q.push(s);
    dist[s]=0;
    while(!q.empty())
    {
        int node=q.front();
        q.pop();
        for(int i=0;i<vec[node].size();++i)
        if(dist[vec[node][i]]>dist[i]+1)
        {
            q.push(vec[node][i]);
            dist[vec[node][i]]=dist[node]+1;
        }
    }
    for(int i=1;i<=n;++i)
    if(dist[i]==INT_MAX)
        cout<<-1<<' ';
    else cout<<dist[i]<<' ';
    return 0;
}