#include <bits/stdc++.h>
using namespace std;

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

vector < int > mu[100001];

int n,m,s;
int d[100001];

queue < int > q;

void bfs(int nod)
{
    q.push(nod);
      d[nod]=1;
    while(!q.empty())
    {
        int vf=q.front();
        q.pop();
        for(int i=0;i<mu[vf].size();i++){ ///cout<<vf<<" "<<mu[vf][i]<<" ";
            if(  mu[vf][i] && !d[mu[vf][i]]  )
               {d[mu[vf][i]]=d[vf]+1;
                  ///  cout<<mu[vf][i]<<" ";
                q.push(mu[vf][i]);}
        }
    }
}
int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        mu[x].push_back(y);

    }
    bfs(s);


    for(int i=1;i<=n;i++){
       if(d[i]!=0)
            fout<<d[i]-1<<" ";
       else
            if(i!=s)
            fout<<-1<<" ";

    }
    return 0;
}