Forwards on Weibo

def solve(nl, data, qcount, qdata):
    n, l = map(int, str(nl).split())
    follows = {}
    for rec in str(data).strip().split(','):
        parts = list(map(int, rec.split()))
        uid, k = parts[0], parts[1]
        follows[uid] = parts[2:2+k]
    from collections import deque
    qcount = int(qcount)
    queries = str(qdata).strip().split(',')
    for i in range(qcount):
        uid = int(queries[i])
        visited = {uid}
        q = deque([(uid, 0)])
        count = 0
        while q:
            node, depth = q.popleft()
            for follower in follows.get(node, []):
                if follower not in visited:
                    visited.add(follower)
                    count += 1
                    if depth + 1 < l:
                        q.append((follower, depth + 1))
        print(count)