#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector<int> g[100001];
int n, m, i, s, p[100001], d[100001];
bool used[100001];
queue<int> q;
void BFS(int s){
used[s] = true;
 while(!q.empty()){
    int v = q.front();
    q.pop();
    for(size_t i = 0; i < g[v].size();i++){
        int to = g[v][i];
        if(!used[to]){
            used[to] = true;
            q.push(to);
            d[to] = d[v] + 1;
        }
    }
 }
}
int main()
{
    ios_base::sync_with_stdio(1);
    cin>>n>>m>>s;
    for(i=1;i<=m;i++){
        int x, y; cin>>x>>y;
        g[x].push_back(y);
    }
    q.push(s);
    BFS(s);
     for(i=1;i<=n;i++){
        if(!used[i]) d[i]=-1;
    }
    for(i=1;i<=n;i++){
        cout<<d[i]<<' ';
    }
    return 0;
}