def bfs(n, m, edges, s):
    graph = {}
    for i in range(1,n+1):
        graph[i] = []
   
    for v1,v2 in edges:
        graph[v1].append(v2)
        graph[v2].append(v1)
    
    visited = [s]
    queue = [s]
    level = [None]*(n)
    level[s-1] = 0
    while queue:
        devertex = queue.pop(0)
        for neighbours in graph[devertex]:
            if neighbours not in visited:
                level[neighbours-1] = level[devertex-1]+6
                visited.append(neighbours)
                queue.append(neighbours)
    res = []
    for i in level:
        if i == None:
            res.append(-1)
        else:
            if i != 0:
                res.append(i)
    return res