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

using namespace std;

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

vector<int> A[1001];

int n,m,s;
int viz[1001];

void BFS(int start)
{
    queue<int> que;

    viz[start]=1;
    que.push(start);
    while(!que.empty())
    {
        int v=que.front();
        for (int i=0; i<A[v].size(); i++)
        {
            int nod=A[v][i];
            if (viz[nod]==0)
            {
                que.push(nod);
                viz[nod]=viz[v]+1;
            }
        }
        que.pop();
    }
}

int main()
{
    cin >> n >> m >> s;
    for (int i=1; i<=m; i++)
    {
        int x,y;
        cin >> x >> y;
        A[x].push_back(y);
    }
    BFS(s);
    for (int i=1; i<=n; i++)
    {
        cout << viz[i]-1 << " ";
    }
}