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

using namespace std;

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

int n, m, k;
vector<int> G[100005]; 
int dist[100005];

void bfs(int start_node) {
    queue<int> q;
    q.push(start_node);
    dist[start_node] = 1;
    
    while(!q.empty()) {
        int nod = q.front();
        q.pop();
        
        for(int i = 0; i < G[nod].size(); i++) {
            int vecin = G[nod][i];
            
            if(dist[vecin] == 0) {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main() {
    fin >> n >> m >> k;
    
    int x, y;
    for(int i = 1; i <= m; i++) {
        fin >> x >> y;
        G[x].push_back(y);
    }
    
    bfs(k);
    
    for(int i = 1; i <= n; i++) {
        fout << dist[i] - 1 << " ";
    }
    
    return 0;
}