#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s;
vector <int> muchii[100005];
int distanta[100005];
queue <int> q;


void bfs()
{
    while (!q.empty())
    {
        int nod=q.front();
        q.pop();
        for (unsigned int i=0;i<muchii[nod].size();i++)
        {
            int vecin=muchii[nod].at(i);
            if (distanta[vecin]==-1)
            {
                distanta[vecin]=distanta[nod]+1;
                q.push(vecin);
            }
        }
    }
}
int main()
{
    f>> n >> m >> s;
    for (int i=1;i<=m;i++)
    {
        int x,y;
        f >> x >> y;
        muchii[x].push_back(y);
    }
    for (int i=1;i<=n;i++)
    {
        distanta[i]=-1;
    }
    distanta[s]=0;
    q.push(s);
    bfs();
    for (int i=1;i<=n;i++)
    {
        g<< distanta[i] << " ";
    }
    return 0;
}