#include <fstream>
#include <queue>
#include <vector>
#define NMAX 100001

using namespace std;

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

vector <int> G[NMAX];
int dist[NMAX];
int pred[NMAX];

queue <int> q;
int s,n,m;

int main()
{
    fin>>n>>m>>s;
    
    for(int i=1;i<=m; ++i)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }
    
    for(int i=1; i<=n; ++i)
        dist[i]=-1;
    dist[s]=0;
    
    q.push(s);
    while(!q.empty()){
        int x=q.front();
        for(unsigned i=0; i<G[x].size(); ++i){
            if(dist[G[x][i]] == -1){
                q.push(G[x][i]);
                dist[G[x][i]]=dist[x]+1;
            }
        }
        q.pop();
    }
    for(int i=1; i<=n; ++i)
        fout<<dist[i]<<" ";
    
    return 0;
}