#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

const int MAX = 1e5 + 1;

vector <int> g[MAX];

int n , m , s , x , y , dm[MAX] , sinit;

bitset <MAX> b;

queue <int> q;

int main()
{

    cin >> n >> m >> s;

    sinit = s;

    while(m--){

        cin >> x >> y;

        g[x].push_back(y);
    }

    b[s] = 1;

    q.push(s);

    while(!q.empty()){

        s = q.front();

        q.pop();

        for(auto y : g[s]){

            if(!b[y]){

                dm[y] = dm[s] + 1;
                b[y] = 1;
                q.push(y);
            }
        }
    }

    for(int i = 1; i <= n ; i++){

        if(i!=sinit && dm[i] == 0) dm[i] = -1;

        cout << dm[i] << ' ';
    }
    return 0;
}