#include<vector>
#include<queue>
#include <iostream>
#include <ifstream>
 
using namespace std;
 
#define NMAX 100005
 
vector<int> graph[NMAX];
bool viz[NMAX];
int n, dist[NMAX], m, source;
ifstream f("bfs.in");
ofstream g("bfs.out");
 
int main() 
{
    int a, b;
    f>>n>>m>>source;    
    for(int i = 1; i <= m; i++) {
        f>>a>>b;
        graph[a].push_back(b);
    }
    
    queue<int> bfs;
    bfs.push(source);
    viz[source] = 1;
    dist[source] = 0;
    
    while(!bfs.empty()) {
        int new_source = bfs.front();
        bfs.pop();
        
        for(auto vecin : graph[new_source]) {
            if(!viz[vecin]) {
                bfs.push(vecin);
                viz[vecin] = 1;
                dist[vecin] = dist[new_source] + 1;
            }
        }
    }
    
    for(int i = 1; i <= n; i++) {
        if(!viz[i]) {
            g<<-1;
        }
        else {
            g<<dist[i];
        }
    }
    g<<"\n";
    
    return 0;
}