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

ifstream cin("bfs.in");
ofstream cout("bfs.out");

const int N = 100001;

vector<vector<int>> graf;
int viz[N];
queue<int> q;

int y;

void bfs(int x)
{
    q.push(x);
    viz[x] = true;
    while (!q.empty()){
        y = q.front();
        q.pop();
        for(int vec: graf[y]){
            if(viz[vec] == 0){
                q.push(vec);
                viz[vec]=viz[y] + 1;
            }
        }
    }
}

int x;

int main() {
    graf.resize(N);
    int n, m, s;
    cin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        cin >> x >> y;
        graf[x].push_back(y);
    }
    bfs(s);
    for(int i = 1; i <= n; i++){
        cout << viz[i] - 1  << ' ';
    }
    return 0;
}