#include <bits/stdc++.h>

using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n,m,s,x,y,i,d[100005];
queue <int> q;
vector <int> v[100005];
void bfs (int s)
{
    int nod;
    d[s]=1;
    q.push(s);
    while (!q.empty())
        {
            nod=q.front();
            q.pop();
            for (int i:v[nod])
                if (!d[i])
                    {
                        d[i]=d[nod]+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++)
        {
            fout<<d[i]-1<<" ";
        }
    return 0;
}