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

#define MAX 100005

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

long int n,m,s;
queue<long int> q;
long int dist[MAX];
vector<long int> graf[MAX];

void bfs(long int n)
{
    q.push(n);
    dist[n] = 0;
    while(!q.empty())
    {
       int a = q.front();
       q.pop();
       for(auto i:graf[a])
       {
           if(dist[i] > dist[a] + 1)
           {
               dist[i] = dist[a]+1;
               q.push(i);
           }
       }

    }
}




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


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

    for(int i=1; i<=n; i++)
    {
        dist[i] = MAX;
    }

    bfs(s);
    for(int i=1; i<=n; i++)
    {
        g << (dist[i]!=MAX ? dist[i]:-1) << ' ';
    }

    return 0;
}