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

using namespace std;

const int N = 100000;
const int INF=-1;

vector <int> a[N+1];
int d[N+1], n;

void bfs(int k)
{
    queue<int>q;
    for(int i=1; i<=n; i++)
        d[i]=INF;
    d[k]=0;
    q.push(k);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto y : a[x])
            if(d[y]==INF)
            {
                d[y]=1+d[x];
                q.push(y);
            }
    }
}

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    int m, k, x, y;
    in>>n>>m>>k;
    for(int i=1; i<=m; i++)
        {
            in>>x>>y;
            a[x].push_back(y);
        }
    bfs(k);
    for(int i=1; i<=n; i++)
        out<<d[i]<<" ";
    in.close();
    out.close();
    return 0;
}