The problem!
Given n, m, the ordering of the soldiers in the circle and the name of the soldier where counting commences, determine the order in which the soldiers are eliminated and which soldier escapes.
Clearly, a circular list in which each node represents a soldier is a natural data structure for solving this problem.