#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
vector <int> G[100001];
queue <int> q;
int dist[100001];
int n, m, nr, s;
void bfs()
{
    dist[s]=0;
    q.push(s);
    int nod;
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(unsigned i=0; i<G[nod].size(); ++i)
            if(dist[G[nod][i]]==-1)
            {
                dist[G[nod][i]]=dist[nod]+1;
                q.push(G[nod][i]);
            }
    }
}
int main()
{
    fin>>n>>m>>s;
    for(int i=1; i<=m; ++i)
    {
        int x, y;
        fin>>x>>y;
        G[x].push_back(y);
    }
    for(int i=1; i<=n; ++i)
        dist[i]=-1;
    bfs();
    for(int i=1; i<=n; ++i)
        fout<<dist[i]<<' ';
}