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.
[[-11, -146, -129, -119, 65], [-117, -143, -132, 70, 11, -141, -186], [-85, -44, -122, -7], [-191, -134, -195, -155], [-94, -133, 83, -41, -153], [-47, 60, -27, -3, -159, 12, 41], [-29, -162, -124, -173, -116, -28]]