#include <fstream>
#include <bitset>
#include <vector>
#include <queue>

using namespace std;
const int NMAX = 100000;

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

vector<vector<int> > ad(NMAX + 2);
bitset<NMAX + 5> viz;
queue<int> Q;
int steps[NMAX + 5];

void BFS(int st)
{
    int i,node;
    Q.push(st);
    viz[st] = 1;
    while(!Q.empty())
    {
        node = Q.front();
        Q.pop();
        for(i = 0; i < ad[node].size(); i++)
            if(!viz[ad[node][i]])
            {
                viz[ad[node][i]] = 1;
                steps[ad[node][i]] = steps[node] + 1;
                Q.push(ad[node][i]);
            }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);

    int n,m,st,i,a,b;
    fin >> n >> m >> st;
    while(m--)
    {
        fin >> a >> b;
        ad[a].push_back(b);
    }
    BFS(st);
    for(i = 1; i <= n; i++)
        if(!viz[i])
            fout << "-1 ";
        else
            fout << steps[i] << " ";
    return 0;
}