#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> v[100005];
queue <int> q;
int a[100005];
int main()
{
    int n, m, s, i, x , y;
    fin >> n >> m >> s;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    q.push(s);
    a[s]=1;
    while(!q.empty())
    {
        s = q.front();
        q.pop();
        for(i=0;i<(int)v[s].size();i++)
        {
            if(a[v[s][i]]!=0)
                continue;
            a[v[s][i]]=a[s]+1;
            q.push(v[s][i]);
        }
    }
    for(i=1;i<=n;i++)
        fout << a[i] - 1<< " ";
    return 0;
}