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.
[[-16, -30, -52, -81, -99, -129], [-14, 94, -167, -1, 28, -2, 46], [-16, -26, -88], [43, 32, 27, 82, -177, -135, 7], [99, 31, -76, -124, -155, -109, 42], [-128, -142, 60, -99, -21, -106], [45, 27, -76, -37, -164], [18, -90, -36, -85], [-129, -180, -184]]