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.
[[-180, -186, -109, -85], [-88, 50, 10, -179, 20, 55], [-14, -148, 99], [50, -40, -182, 100], [74, -161], [-85, -53], [-166, -61, -79, 41], [-38, -182, -69]]