#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <list>
#include <queue>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,sol,dist[100005],s;
const int M=100005;
list<int>vecini[100005];
bitset<M> v;
queue<int> Q;
void bfs(int x)
{
    Q.push(x);
    v[x]=1;
    while(!Q.empty())
    {
        for(auto node : vecini[Q.front()])
        {
            if(v[node]==0)
            {
                v[node]=1;
                dist[node]=dist[Q.front()]+1;
                Q.push(node);

            }
        }
        Q.pop();

    }
}

int main()
{
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        vecini[x].push_back(y);
    }
    bfs(s);
    for(int i=1; i<=n; i++)
    {
        if(v[i]==0)
            fout<<"-1 ";
        else
        fout<<dist[i]<<" ";

    }
    return 0;
}