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

using namespace std;

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

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

int n, m, s;
int d[N];
queue<int> q;
vector<int> a[N+1];

int main()
{

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

    for(int i=1; i<=n;i++)
        d[i]=INF;
    q.push(s);
    d[s]=0;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto y: a[x])
        {
            if(d[y]==INF)
            {
                q.push(y);
                d[y]=1+d[x];
            }
        }
    }
    for(int i=1; i<=n; i++)
        out<<d[i]<<' ';
    in.close();
    out.close();
    return 0;
}