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

using namespace std;
ifstream cin ("bfs.in");
ofstream cout ("bfs.out");
queue <int> Q;
vector <int> a[100005];
int viz[100005],vecin[100005],cnt,n,m,k;
int distanta[100005];
void bfs(int nod)
{
    vecin[nod]=1;
    Q.push(nod);
    while (!Q.empty())
    {
        nod=Q.front();
        Q.pop();
        viz[nod]=1;
        for (int i=0;i<a[nod].size();i++)
        {
            if (vecin[a[nod][i]]==0)
            {
                distanta[a[nod][i]]=distanta[nod]+1;
                vecin[a[nod][i]]=1;
                Q.push(a[nod][i]);
            }
        }
    }
}
int main()
{
    cin >> n >> m >>k;
    for (int i=1;i<=m;i++)
    {
        int x,y;
        cin >> x >> y;
        a[x].push_back(y);
    }
    bfs(k);
    for (int i=1;i<=n;i++)
    {
        if (viz[i]==0) distanta[i]=-1;
    }
    for (int i=1;i<=n;i++)
        cout <<distanta[i] << " ";
    return 0;
}