#include <fstream>
#include <queue>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
queue <int> q;
int viz[100001],d[100001],n,i,m,s,x,y;
vector <int> v[100005];
void bfs(int s)
{
    int i,j;
    q.push(s);
    for(i=1;i<=n;i++) d[i]=-1;
    d[s]=0;
    viz[s]=1;
 while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(i=0;i<v[nod].size();i++)
        {
            if(!viz[v[nod][i]])
            {
                q.push(v[nod][i]);
                d[v[nod][i]]=d[nod]+1;
                viz[v[nod][i]]=1;
            }
        }
    }
}
int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
    {
        fout<<d[i]<<" ";
    }
    return 0;
}