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

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int nmax=100000;
queue <int> q;
vector <int> g[nmax+1];
int n,m,s;
int viz[nmax+1];
int d[nmax+1];
int main()
{
    int i,x,y;
    fin>>n>>m>>s;
    for(i=0;i<m;++i){
        fin>>x>>y;
        g[x].push_back(y);
    }
    q.push(s);
    viz[s]=1;
    while(!q.empty()){
        x=q.front();
        for(i=0;i<g[x].size();++i){
            y=g[x][i];
            if(!viz[y]){
                viz[y]=1;
                d[y]=d[x]+1;
                q.push(y);
            }
        }
        q.pop();
    }
    for(i=1;i<=n;++i){
        if(!viz[i]){
            fout<<"-1 ";
        } else {
            fout<<d[i]<<" ";
        }
    }


    return 0;
}