#include <fstream>
#include <queue>
#include <vector>

using namespace std;

const int NMAX=100005;
int v[NMAX];
bool f[NMAX];

vector <int> a[NMAX];

queue <int> q;


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

int main()
{
    int n,m,s,i,x,y,z;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        a[x].push_back(y);
    }
    q.push(s);
    v[s]=0;
    while(!q.empty()){
        x=q.front();
        q.pop();
        y=a[x].size();
        for(i=0;i<y;i++){
            z=a[x][i];
            if(!v[z]&&z!=s){
                q.push(z);
                v[z]=v[x]+1;
                f[z]=1;
            }
        }
    }
    for(i=1;i<=n;i++){
        if(!f[i]&&i!=s){
            fout<<"-1 ";
            continue;
        }
        fout<<v[i]<<" ";
    }
    return 0;
}