#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,k,x,y,viz[100005];
vector<int>v[100005];
queue<int>q;
void bfs(int x)
{
    q.push(x);
    viz[x]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(int i=0; i<v[x].size(); i++)
            if(viz[v[x][i]]==0)
            {
                q.push(v[x][i]);
                viz[v[x][i]]=viz[x]+1;
            }
    }
}
int main()
{
    f>>n>>m>>k;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    bfs(k);
    for(int i=1; i<=n; i++)
        if(viz[i]==0)
            g<<-1<<" ";
        else
            g<<viz[i]-1<<" ";
    return 0;
}