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

using namespace std;

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

#define MAX 100010

vector < int > g[MAX];
queue < int > q;

int viz[MAX];
int n,m,s;

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

int main()
{
    int i,x,y;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        g[x].push_back(y);
    }
    viz[s]=1;
    q.push(s);
    bfs();
    for(i=1;i<=n;i++)
        fout<<viz[i]-1<<" ";
    fin.close();
    fout.close();
    return 0;
}