#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int S;
int d[100001];

unordered_map<int,list <int>> matr;

void BFS(int poz, int dis)
{
    vector<int> tmp;
    matr[poz].sort();
    for(int vec:matr[poz])
    {
        if(vec!=poz && (d[vec]==-1 || d[vec]>dis+1))
        {
            tmp.push_back(vec);
            d[vec]=dis+1;
        }
    }
    for(int vec:tmp)
    BFS(vec,dis+1);
}
int main()
{
    int N,M;
    fin>>N>>M>>S;

    while(M)
    {
        int x,y;
        fin>>x>>y;
        matr[x].push_back(y);
        M--;
    }

    for (int i=1;i<=N;i++)
        d[i]=-1;

    d[S]=0;
    BFS(S,0);

    for(int i=1;i<=N;i++)
    cout<<d[i]<<" ";
    return 0;
}