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.
[[71, -29, -22, -129, -49, -185, 29], [-182, 69, -146, -26, -156], [-179, -158, -55, -184, -149, -62, 81], [15, 12, -68], [44, 20, -82, 18, -96, 91, -86], [-65, 5, 1, -150, -163, -137], [-58, -80, -113, 46, -191, -149, -65]]