Eight runners race for gold, silver and bronze. Fill the podium one step at a time: any of the 8 can take gold, then 7 runners remain for silver, then 6 for bronze, so there are 8×7×6=336 possible podiums. The formula P(8,3)=5!8! gives the same number, because the 5! underneath cancels the tail 5×4×3×2×1 that belongs to the five runners without a medal.
Order is what makes each of those 336 a separate outcome. Ana, Ben, Cal on the podium is not the same result as Ben, Ana, Cal, since different people hold gold. Any three runners can stand on the podium in 3!=6 orders, and the permutation counts all 6. The formula also assumes no item is used twice: one runner cannot take gold and silver. When repeats are allowed, as in a 3-digit lock code, the count is 10×10×10=1000, not 10×9×8=720.
Picking 3 of the 8 runners to represent the school, with no positions, looks like the same problem but is not. Ana-Ben-Cal and Ben-Ana-Cal are the same team, so each team appears 6 times among the 336 podiums, and the number of teams is 6336=56, a combination. Titles, ranks and places make order matter; a plain group does not.
Think of it like this. A permutation is like seating friends in numbered seats. With five friends and three numbered seats, seat 1 has 5 candidates, seat 2 has 4 and seat 3 has 3. Moving two friends between seats creates a new seating, which is why order counts; on an unnumbered bench, it would be a combination.
Core idea. A permutation counts the ways to line up r chosen items from n when the order of the line matters.