You are given the following list of integers and are asked to sort them in increasing order:

[386, 250, 720, 412, 718]

You are to apply Radix Sort, using Counting Sort as a stable sorting algorithm at each digit level, starting from the least significant digit.

After sorting the array by the second digit (tens place), what will the list look like?