#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
#define MOD 1000000009

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<int> adj[100001];
int d[100001];
int n,m,s;

int main()
{
    fin >> n >> m >> s;
    while(m--)
    {
        int x,y;
        fin >> x >> y;
        adj[x].push_back(y);
    }
    queue<int> Q;
    Q.push(s);
    memset(d,-1,sizeof(d));
    d[s]=0;
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        for(auto i : adj[x])
        {
            if(d[i]==-1)
            {
                d[i]=d[x]+1;
                Q.push(i);
            }
        }
    }
    for(int i=1;i<=n;i++)fout << d[i] << " ";
}