#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream is ("bfs.in");
ofstream os ("bfs.out");

vector <int> V[100001];
queue <int> Q;

int n, s, m, viz[100001], d[100001];
void Read();
void Cross();
int main()
{
    Read();
    Cross();
    for(int i = 1; i <= n; ++i)
    {
        if(!d[i] && i != s)
            os << -1 << ' ';
        else
            os << d[i] << ' ';
    }
    return 0;
}
void Read()
{
    int x, y;
    is >> n >> m >> s;
    for(int i = 1; i <= m; ++i)
    {
        is >> x >> y;
        if ( x != y)
            V[x].push_back(y);
    }
    viz[s] = 1;
    Q.push(s);
}
void Cross()
{
    int nod;
    while(!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        viz[nod]++;
        for(int i = 0; i < V[nod].size(); ++i)
            if(!viz[V[nod][i]])
            {
                Q.push(V[nod][i]);
                viz[V[nod][i]]++;
                d[V[nod][i]] = d[nod]+1;
            }
    }
}