#include<fstream>
#include <algorithm>
#include <list>
#include <queue>
#include <vector>
#include <array>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
queue <int> q;
vector<int> v[100001];
int main()
{
    int n,m,s,x,y,i,u;
    in>>n>>m>>s;
    int d[100001];
    bool h[100001];
    q.push(s);
    h[s]=1;
    for(i=0;i<m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    while(!q.empty())
    {
        u = q.front();
        q.pop();
        h[u]=1;
        for( auto it =v[u].begin();it!=v[u].end();++it)
            if (h[*it]==0)
            {
                h[*it] = 1;
                d[*it] = d[u]+1;
                q.push(*it);
            }
    }
     for(i=1;i<=n;i++)
     if (d[i]==0 && i!=s)
        out<<"-1 ";
     else
        out<<d[i]<<" ";
}