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

using namespace std;

queue <int> q;
int vis[100005];
int dist[100005];
vector <int> mu[100005];
int n,m,s,a,b;

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


void bfs(int start){
    q.push(start);
    vis[start]=1;
    dist[start]=0;
    while(!q.empty()){
        int nod=q.front();
        for(int i=0;i<mu[nod].size();i++)
            if(vis[mu[nod][i]]==0)
                {
                    q.push(mu[nod][i]);
                    dist[mu[nod][i]]=dist[nod]+1;
                    vis[mu[nod][i]]=1;
                }
            q.pop();
    }
}

int main()
{
    in>>n>>m>>s;
    for(int i=1;i<=m;i++){
        in>>a>>b;
        mu[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        dist[i]=-1;
    bfs(s);
    for(int i=1;i<=n;i++)
        out<<dist[i]<<" ";

    return 0;
}