#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
const int NMAX=1e5+1;
vector<int>g[NMAX];
int start,n;
queue<int>q;
int d[NMAX];
void lee()
{
    for(int i=1;i<=n;i++)
    {
        d[i]=(1<<30);
    }
    d[start]=0;
    q.push(start);
    while(q.size()!=0)
    {
        int curent=q.front();
        q.pop();
        for(int i=0;i<g[curent].size();i++)
        {
            int neighbour=g[curent][i];
            if(d[neighbour]>d[curent]+1)
            {
                q.push(neighbour);
                d[neighbour]=d[curent]+1;
            }
        }
    }
}
int main()
{
    int m,s;
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int node1,node2;
        cin>>node1>>node2;
        g[node1].push_back(node2);
    }
    start=s;
    lee();
    for(int i=1;i<=n;i++)
    {
        if(d[i]==(1<<30))
            cout<<-1<<" ";
        else
            cout<<d[i]<<" ";
    }
    return 0;
}