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

using namespace std;

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

const int N=100001;
vector <int> a[N];
queue <int> q;
int d[N];

int main()
{
    int n,m,s,x,y,i;
    in >> n >> m >> s;
    for(i=0; i<m; i++)
    {
        in >> x >> y;
        a[x].push_back(y);
    }
    for(i=1; i<=n; i++)
    {
        d[i]=-1;
    }
    d[s]=0;
    q.push(s);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0; i<a[x].size(); i++)
        {
            y = a[x][i];
            if(d[y]==-1)
            {
                d[y]=1+d[x];
                q.push(y);
            }
        }
    }
    for(i=1; i<=n; i++)
        out << d[i] << " ";
    return 0;
}