#include <bits/stdc++.h>

using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n,m,s,x,y;
const int NMAX=100005;
vector <int> G[NMAX];
queue <int> q;

int viz[NMAX];

int main()
{
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    q.push(s);
    //viz[s]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0; i<G[nod].size(); i++)
        {
            if(!viz[G[nod][i]] && G[nod][i]!=s)
            {
                q.push(G[nod][i]);
                viz[G[nod][i]]=viz[nod]+1;
            }

        }
    }
    for(int i=0;i<=n;i++)
    {
        if(i!=s && viz[i]==0) fout<<"-1 ";
        else fout<<viz[i]<<" ";
    }
    return 0;
}