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