#include <fstream>
#define dim 100005
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,i,x,y,f[dim],s,m;
vector<int> v[dim];
queue <int> q;
void bfs(int x){
    q.push(x);
    f[x]=1;
    while(!q.empty()){
        x=q.front();
        for(int i=0;i<v[x].size();i++){
            if(f[v[x][i]] == 0){
                f[v[x][i]]=f[x]+1;
                q.push(v[x][i]);
            }
        }
        q.pop();
    }
}
int main(){
    fin>>n>>m>>s;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++){
        fout<<f[i]-1<<" ";
    }




    return 0;
}