#include <bits/stdc++.h>
#define NMAX 100001
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
queue<int> q;
vector<int> vecini[NMAX];
int dist[NMAX];
int n,m,s;

int main()
{
    fin>>n>>m>>s;

    for(int i=1;i<=m;i++) {
        int x,y;
        fin>>x>>y;
        vecini[x].push_back(y);
    }

    for(int i=1;i<=n;i++) dist[i]=-1;

    q.push(s);
    dist[s]=0;

    for(;q.size();q.pop()) {
        int currNode = q.front();
        for(auto x:vecini[currNode]) if(dist[x]==-1) {
            dist[x]=dist[currNode]+1;
            q.push(x);
        }
    }

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