#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in ("bfs.in");
ofstream out ("bfs.out");
vector <int> v[100002];
queue <int> c;
int n,m,k,x,y,viz[100002],i;
void bfs(int k)
{
    int i;
    c.push(k);
    viz[k]=1;
    while(!c.empty())
    {
        int nod=c.front();
        c.pop();
        for(i=0;i<v[nod].size();i++)
        {
            if(!viz[v[nod][i]])
            {
                c.push(v[nod][i]);
                viz[v[nod][i]]=viz[nod]+1;
            }
        }
    }
}
int main()
{
in>>n>>m>>k;
for(i=1;i<=m;i++)
{
    in>>x>>y;
    v[x].push_back(y);
}
bfs(k);
for(i=1;i<=n;i++)
{
    out<<viz[i]-1<<" ";
}
    return 0;
}