can some one explain for me what is required in this problem and how we get this sample output from the sample input as the explanation isn't clear for me, thanks in advance.

UVA #11590 — Prefix Lookup

bfs problem: https://mirror.codeforces.com/problemset/problem/1105/D