#include <iostream>
#include <fstream>
#include <queue>
#include <algorithm>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
queue<int> q;
vector<int> a[100005];
int n,m,x,k,i,j,viz[100005];
void bfs(int p)
{
    q.push(p);
    viz[p]=1;
    while(!q.empty())
    {
        int t=q.front();
        for(int i=0;i<a[t].size();i++)
            if(!viz[a[t][i]])
            {
                q.push(a[t][i]);
                viz[a[t][i]]=viz[t]+1;
            }
        q.pop();
    }
}int main()
{
    f>>n>>m>>x;
    for(k=1;k<=m;k++)
    {
        f>>i>>j;
        a[i].push_back(j);
    }
    bfs(x);
    for(i=1;i<=n;i++)
        if(!viz[i])
            g<<-1<<" ";
        else
            g<<viz[i]-1<<" ";
    return 0;
}