#include <bits/stdc++.h>

using namespace std;
ifstream fi("bfs.in");
ofstream fo("bfs.out");
const int nmax=1e5;
int n, m, s;
int viz[nmax+5];
vector <int> G[nmax+5];
queue <int> Q;

void bfs(void)
{
    Q.push(s);
    viz[s]=1;
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        for(auto vec:G[nod])
            if(!viz[vec])
            {
                Q.push(vec);
                viz[vec]=viz[nod]+1;
            }
    }
}

int main()
{
    fi>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x, y;
        fi>>x>>y;
        G[x].push_back(y);
    }
    bfs();
    for(int i=1; i<=n; i++)
        fo<<viz[i]-1<<" ";
    fi.close();
    fo.close();
    return 0;
}