There are n activities and m students. Each student can do as many activities as possible. I want to figure out the shortest path is between two students. I need to focus on