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

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

const int NMAX = 1e5;
int n, m, s;
vector<int> G[NMAX + 1];
int dist[NMAX + 1];
bool viz[NMAX + 1];

void BFS(int s)
{
    viz[s] = 1;
    dist[s] = 0;
    queue<int> Q;
    Q.push(s);

    while(!Q.empty())
    {
        int Nod_Curent = Q.front();
        Q.pop();

        for(int Nod : G[Nod_Curent])
        {
            if(!viz[Nod])
            {
                dist[Nod] = dist[Nod_Curent] + 1;
                viz[Nod] = 1;
                Q.push(Nod);
            }
        }
    }
}

int main()
{
    cin >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        cin >> x >> y;
        G[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
        dist[i] = -1;

    BFS(s);
    for(int i = 1; i <= n; i++)
        cout << dist[i] << ' ';


    return 0;
}