#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

vector<int> graf[100005];
queue<int> Q;
int l[100005], s, n, m;

void citire()
{
    int x, y;
    f>>n>>m>>s;
    for(int i = 0; i<m; ++i)
    {
        f>>x>>y;
        graf[x].push_back(y);
    }
}

void lee()
{
    while(!Q.empty())
    {
        int nod = Q.front();
        Q.pop();
        for(auto &v : graf[nod])
        {
            if(l[v] == 0)
            {
                Q.push(v);
                l[v] = l[nod]+1;
            }
        }
    }
}

void rez()
{
    Q.push(s);
    l[s] = 1;
    lee();
    for(int i = 1; i<=n; ++i)
            g<<l[i]-1<<" ";
}

int main() {
    citire();
    rez();
    return 0;
}