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.
[[-13, 91, 20, 3, -173], [-7, -192, 31, 29], [-81, 66, 77], [5, -131, -179, -198, 82, -177, -3], [-187, -20, -118, -134, -151, 90, -17], [-59, -51, -106, -139, -96, 79], [-120, -94, 23, -76, 81, 79], [28, 5], [-59, -44, -89, 71, -72, -95, -83]]