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.
[[-189, -139, 78, -81, -191, -68], [-111, -196, -26, 29], [64, -185, -163, 64, -103, 31, -174], [-83, 75, -90, -30, -184, 89], [69, -116, -105, -7], [16, 26, -122]]