#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
#define MAXN 100001
#define INF 0x3f3f3f3f
int n,m,start,x,y;
vector<int> graf[MAXN];
int dist[MAXN];
void dfs(int nod)
{
    for(int i=0; i<graf[nod].size(); i++)
    {
        if(dist[graf[nod][i]] > dist[nod] + 1)
        {
            dist[graf[nod][i]] = dist[nod] +1;
            dfs(graf[nod][i]);
        }
    }
}
int main()
{
    int i,j;
    cin>>n>>m>>start;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        graf[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        dist[i]=INF;

    dist[start]=0;
    dfs(start);

    for(i=1; i<=n; i++)
    {
        if(dist[i]==INF)
            dist[i]=-1;
        cout<<dist[i]<<" ";
    }

}