#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector <int> L[100005];
int d[100005];
queue<int> q;
int n, m, s, i, j, x, y;
int main(){
    cin>>n>>m>>s;
    for(i=1; i<=m; i++){
        cin>>x>>y;
        L[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        d[i]=-1;
    d[s]=0;
    q.push(s);
    while(!q.empty()){
        x=q.front();
        q.pop();
        for(j=0;j<L[x].size();j++){
            y=L[x][j];
            if(d[y]==-1 || d[y]>d[x]+1){
                d[y]=d[x]+1;
                q.push(y);
            }

        }
    }
    for(i=1;i<=n;i++)
        cout<<d[i]<<" ";
}