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

using namespace std;

int main()
{
    ifstream reader ("bfs.in");
    ofstream writer ("bfs.out");
    int n, m, s;
    reader >> n >> m >> s;
    
    vector <int> dist(n + 1);
    vector <bool> isViz(n + 1);
    vector<vector<int>> adj(n + 1);
    
    for(int i = 0; i < m; ++i)
    {
        int x, y;
        reader >> x >> y;
        
        adj[x].emplace_back(y);
    }
    
    queue<int> q;
    
    isViz[s] = true;
    q.push(s);
    
    while(!q.empty())
    {
        int r = q.front();
        q.pop();
        
        for(auto i : adj[r])
        {
            if(!isViz[i])
            {
                q.push(i);
                dist[i] = dist[r] + 1;
                isViz[i] = true;
            }
        }
    }
    
    for(int i = 1; i <= n; ++i)
    {
        if(!isViz[i])
            writer << -1 << ' ';
        else
            writer << dist[i] << ' ';
    }
    
    return 0;
}