#include <fstream>
#include <queue>
#include <vector>
using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector <int> G[100001];
int viz[100001],n,m,s;
void BFS(int start)
{
    viz[start]=1;
    queue <int> que;
    que.push(start);
    while(!que.empty())
    {
        int v = que.front();
        for(unsigned int i=0; i<G[v].size(); ++i)
        {
            int j = G[v][i];
            if(!viz[j])
            {
                viz[j]=viz[v]+1;
                que.push(j);
            }
        }
        que.pop();
    }
}
int main()
{
    cin>>n>>m>>s;
    while(m--)
    {
        int x,y;
        cin>>x>>y;
        G[x].push_back(y);
    }
    BFS(s);
    for(int i=1;i<=n;++i)
    {
        if(i==s) cout<<0;
        else
        {
            if(viz[i]==0) cout<<"-1";
            else cout<<viz[i]-1;
        }
        cout<<' ';
    }
}