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.
[[33, -110, 39, -134, 78, -99, 58], [-120, -156, -97], [16, -174], [-196, 81, 71, -69], [-44, -11, -181, -19, -158, -39]]