#include <fstream>
#include <vector>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n,m,start,i,x,y,c[100005],d[100005];
vector<int> L[100005];

int main()
{
    fin >> n >> m >> start;
    for (;m--;)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
    int p = 1; int u = 1; c[1] = start; d[start] = 1;
    while (p <= u)
    {
        int nod = c[p];
        for (i=0; i<L[nod].size(); i++)
        {
            int vecin = L[nod][i];
            if (!d[vecin])
            {
                c[++u] = vecin;
                d[vecin] = d[nod]+1;
            }
        }
        p++;
    }
    for (i=1; i<=n; i++)
        if (!d[i])
            fout << -1 << " ";
        else
            fout << d[i]-1 << " ";
    return 0;
}