#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,s,m;
vector <int> noduri[100001];
queue <int> coada;
int distanta[100001];
void BFS(){int actual;
    while(!coada.empty()){
actual=coada.front();
coada.pop();
for(unsigned int i = 0; i<noduri[actual].size();i++){
    if(distanta[noduri[actual][i]]== -1){coada.push(noduri[actual][i]);
                                         distanta[noduri[actual][i]]=distanta[actual]+1;}
}
}


}
void citire(){fin>>n>>m>>s;
              int x,y,i;
             for(i=0;i<m;i++){fin>>x>>y;
                              noduri[x].push_back(y);}
            for(i=1;i<=n;i++){distanta[i]=-1;}
            distanta[s]=0;
            coada.push(s);
              BFS();  }

int main()
{ citire();
for(int i=1;i<=n;i++){fout<<distanta[i]<<" ";}
}