In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[-176, -132, 88, -72, -146], [-52, 21, -77, -15], [45, -51, -137, -109, -102, 19], [72, -165, -153, -169, 23, -90], [24, 60, -26, -88], [86, -192, 23, -199, -64, -180, 61], [-19, -79, -121, -151, -186], [-153, -65, 13, 2]]