#include <iostream>
#include <fstream>
#include <vector>
#include <queue>


using namespace std;

const int NMAX=1000001;
vector<int> G[NMAX];
bool viz[NMAX];
int dist[NMAX];
int n,m,s;

ifstream f("bfs.in");
ofstream g("bfs.out");

queue<int> q;
void bfs(){
    q.push(s);
    viz[s]=1;
    dist[s]=0;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();

        for(auto num:G[nod])
        {
            if(!viz[num])
            {
                q.push(num);
                viz[num]=1;
                dist[num]=dist[nod]+1;
            }
        }
        for(int i=1;i<=n;i++)
        {
            if(dist[i]==0 && i!=s)
            {
                dist[i]=-1;
            }
        }
    }

}


int main()
{
    f >> n >> m >> s;
    for(int i=0;i<m;i++)
    {
        int x,y;
        f >> x >> y;
        G[x].push_back(y);
    }
    bfs();
    for(int i=1;i<=n;i++)
    {
        g << dist[i] << " ";
    }


    return 0;
}