#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

int main(){
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    int n,m,s;

    queue<int> q;
    fin>>n>>m>>s;
    vector<vector<int>> v(n+1);
    vector<int> viz(n+1,0),d(n+1,-1);
    for(int i=0;i<m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);

    }
    q.push(s);
    viz[s]=1;
    d[s]=0;
    while(q.size()>0){
        int x=q.front();
        q.pop();
        for(auto y: v[x]){
            if(viz[y]==0){
                q.push(y);
                viz[y]=1;
                d[y]=d[x]+1;
            }
    }

    }
    for(int i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;



}