#include <fstream>
#include <bits/stdc++.h>

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