#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");


const int N=100005;
vector <int> g[N];
int n,m,s,d[N];
bool viz[N];

void citire()
{
    cin>>n>>m>>s;
    int x,y;
    for(int i=0; i<m; i++)
    {
        cin>>x>>y;
        g[x].push_back(y);
    }
}
void bfs()
{
    viz[s]=1;
    queue <int> q;
    q.push(s);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto i:g[x])
            if(viz[i]==0)
            {
                viz[i]=1;
                q.push(i);
                d[i]=d[x]+1;
            }
    }
}
int main()
{
    citire();
    bfs();
    for(int i=1; i<=n; i++)
    {
        if(viz[i]==0)
            cout<<-1<<' ';
        else
            cout<<d[i]<<' ';
    }
    return 0;
}