#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
int main()
{
    int n,muc,s,i,x,y,it1;

    f>>n>>muc>>s;
    vector <vector<int>> m(n+1);
    queue <int> q;
    vector<int> dist(n+1,n);

    for(i=1; i<=muc; i++)
    {
        f>>x>>y;
        m[x].push_back(y);
    }

    q.push(s);
    dist[s]=0;
    while(!q.empty())
    {
        it1=q.front();
        for(auto it2=m[it1].begin(); it2!=m[it1].end(); ++it2)
            if(dist[*it2]==n)
            {
                q.push(*it2);
                dist[*it2]=dist[it1]+1;
            }
        q.pop();
    }

    for(i=1; i<=n; i++)
    {
        if(dist[i]==n)
            dist[i]=-1;
        g<<dist[i]<<" ";
    }
    return 0;
}