#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

const int NMAX = 100001;
vector <int> Muchii[NMAX];
queue <int> coada;
int dist[NMAX];

void BFS() {
    int nod, v;
    while(!coada.empty()) {
        nod=coada.front();
        coada.pop();
        for(unsigned i=0; i<Muchii[nod].size(); i++) {
            if(dist[Muchii[nod][i]] ==-1) {
                coada.push(Muchii[nod][i]);
                dist[Muchii[nod][i]]=dist[nod]+1;
            }
        }
    }
}

int main()
{
    int n,m,s;
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++) {
        int x,y;
        fin>>x>>y;
        Muchii[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        dist[i]=-1;
    dist[s]=0;
    coada.push(s); BFS();
    for(int i=1; i<=n; i++)
        fout<<dist[i]<<' ';
    return 0;
}