#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fi("bfs.in");
ofstream fo("bfs.out");
int n,m,s,d[100001];
bool vz[100001];
vector<int>v[100001];
queue<int>q;
int main()
{
    int i,x,y;
    size_t j;
    fi >> n >> m >> s;
    for(i=1; i<=n; i++)
        d[i] = -1;
    while(fi >> x >> y)
        v[x].push_back(y);
    q.push(s);
    vz[s] = true;
    d[s] = 0;
    while(!q.empty())
    {
        m = q.front();
        q.pop();
        for(j=0; j<v[m].size(); j++)
        {
            if(!vz[v[m][j]])
            {
               q.push(v[m][j]);
               vz[v[m][j]] = true;
               d[v[m][j]] = d[m]+1;
            }
        }
    }
    for(i=1; i<=n; i++)
        fo << d[i] << " ";
    return 0;
}