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.
[[-128, -149], [16, -6, 33, -7, -60, -186], [9, 31, -191, -159, -5, -152, -143], [-5, 82, -145], [75, -72, -32, 46, 92, 9, 80]]