#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#include <queue>
std::ifstream in("bfs.in");
std::ofstream out("bfs.out");

using namespace std;
vector <int> v[100005];
queue < int > q;
int drum[100005];
int n,m,x;
void bfs(int s)
{
    memset(drum,INF,sizeof(drum));
    drum[s]=0;
    while(!q.empty())
    {
        int vec=q.front();
        q.pop();
        for(int i=0;i<v[vec].size();i++)
        {
            if(drum[vec] + 1 < drum[v[vec][i]])
            {
                drum[v[vec][i]]=drum[vec]+1;
                q.push(v[vec][i]);
            }
        }
    }
}
int main()
{
    in>>n>>m>>x;
    q.push(x);
    for(int i=0;i<m;i++)
    {
        int a,b;
        in>>a>>b;
        v[a].push_back(b);
    }
    bfs(x);
    for(int i=1;i<=n;i++)
    {
        if(drum[i]!=INF)
        {
            out<<drum[i]<<" ";
        }
        else out<<"-1 ";
    }
    return 0;
}