/** \brief
#include <set>
#include <vector>
#include <iostream>


std::vector<int> incrementalBackups(int lastBackupTime, std::vector<std::vector<int>> changes) {
   std::set<int> s;
    for(auto i=changes.begin();
       i!=changes.end();++i){
        if((*i)[0]>lastBackupTime)
            s.insert((*i)[1]);
    }
    std::vector<int> v;
    for(auto i=s.begin();i!=s.end();++i){
        v.push_back(*i);
    }
    return v;
}

int main(){
    std::vector<int> v=incrementalBackups(123,{{122,1},{124,2},{126,1},{121,6},{123,5},{128,9},{125,9}});
    for(auto i=v.begin();i!=v.end();++i)
        std::cout<<*i<<"  ";
}



#include <stdio.h>
#include <string.h>



int main(void) {

  // disable stdout buffering
  setvbuf(stdout, NULL, _IONBF, 0);

  // keep this function call here
  char* str[100];
  scanf("%s",str);
size_t last=strlen(*str);
  return 0;

}
 */

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

using namespace std;

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

int n,m,s;
vector<int> g[1000001];
int viz[1000001];
int d[1000001];
void read()
{
    int x,y;
    fin>>n>>m>>s;
    x=m;
    for(;m;m--){
        fin>>x>>y;
        g[x].push_back(y);
    }
}
void bfs()
{
    queue<int> q;
    q.push(s);
    d[s]=1;
    while(!q.empty())
    {
        int f=q.front();
        q.pop();
        viz[f]=1;
        for(auto it=g[f].begin();it!=g[f].end();++it)
        {
            if(!viz[*it]){
                viz[*it]=1;
                q.push(*it);
                d[*it]=d[f]+1;
            }
        }
    }
    for(int i=1;i<=n;i++){
        gout<<d[i]-1<<" ";
    }

}
int main()
{

    read();
    bfs();
}