#include <cstdio>
#include <queue>
#include <vector>
#include <cstdlib>

using namespace std;

int main()
{
    int *dist;
    int N,M,S,a,b;
    queue<int>q;
    FILE *f=fopen("bfs.in","r");
    FILE *out=fopen("bfs.out","w");
    fscanf(f,"%i %i %i",&N,&M,&S);
    dist = (int*)calloc(N,sizeof(int));
    vector<vector<int>> g(N);
    for(int x=0;x<M;++x)
    {
        fscanf(f,"%i %i",&a,&b);
        g[a-1].push_back(b-1);
    }
    q.push(S);
    int e;
    while(!q.empty())
    {
        e = q.front();
        for(int i: g[e])
        {
            if((dist[i]>dist[e]+1) || (!dist[i]))
            {
                dist[i] = dist[e]+1;
                q.push(i);
            }
        }
        q.pop();
    }
    for(int x=0;x<N;x++)
        fprintf(out,"%i ",dist[x]-1);
    return 0;
}