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

#define nmax 100001
#define inf 1<<30

using namespace std;

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

int n, m, S;
int firstVertex, secondVertex;
int cost[nmax];

vector <int> G[nmax];
queue <int> q;

void read();
void init();
void bfs();
void write();

int main()
{
    
    read();
    bfs();
    write();
    
    return 0;
}

void read()
{
    fin >> n >> m >> S;
    for (int i = 1; i <= n; i++)
    {
        fin >> firstVertex >> secondVertex;
        G[firstVertex].push_back(secondVertex);
    }
}

void init()
{
    for (int i = 1; i <= n; i++)
        cost[i] = inf;
    cost[S] = 0;
}

void bfs()
{
    init();
    
    q.push(S);
    
    while (!q.empty())
    {
        
        int currentVertex = q.front();
        
        q.pop();
        
        for (int i = 0; i < G[currentVertex].size(); i++)
        {
            
            int neighborVertex = G[currentVertex][i];
            
            if (cost[neighborVertex] > cost[currentVertex] + 1)
            {
                cost[neighborVertex] = cost[currentVertex] + 1;
                q.push(neighborVertex);
            }
            
        }
        
    }
    
}

void write()
{
    for (int i = 1; i <= n; i++)
    {
        if (cost[i] == inf)
            cost[i] = -1;
        fout << cost[i] << " ";
    }
}