#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
const int nmax=100005;
int n,m,s,dist[nmax];
queue <int> q;
vector <int> muchii[nmax];
void bfs()
{
    while (!q.empty())
    {
        int nod=q.front();
        q.pop();
        for (int i=0;i<muchii[nod].size();i++)
        {
            int vecin=muchii[nod][i];
            if (dist[vecin]==-1)
            {
                dist[vecin]=dist[nod]+1;
                q.push(vecin);
            }
        }
    }
}
int main()
{
    fin >> n >> m >> s;
    for (int i=1;i<=m;i++)
    {
        int x,y;
        fin >> x >> y;
        muchii[x].push_back(y);
    }
    for (int i=1;i<=n;i++)
    {
        dist[i]=-1;
    }
    dist[s]=0;
    q.push(s);
    bfs();
    for (int i=1;i<=n;i++)
    {
        fout << dist[i] << " ";
    }
}