#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3F3F3F3F
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");

const int maxim=1e5+1;
vector<int>G[maxim];
int n,m,s,d[maxim];

void bfs(int s)
{
    queue<int>Q;
    d[s] = 0;
    Q.push(s);
    while (!Q.empty())
    {
        int k = Q.front();
        Q.pop();
        for (auto i:G[k])
            if (d[i]==0&&s!=i)
            {
                d[i]=d[k]+1;
                Q.push(i);
            }
    }
}

int main()
{
    int x,y;
    fin>>n>>m>>s;
    for (int i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    bfs(s);
    for (int i=1; i<=n; i++)
        if(d[i]==0&&s!=i)
            fout<<"-1 ";
        else
            fout<<d[i]<<" ";
    return 0;
}