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.
[[71, 16, 38, -167, -162], [-91, -135], [-53, -164, -107, -20, -158], [-84, 12], [-112, -185, -199, -38], [-18, -54, 7, -18], [-138, 73, 100, -132], [-174, -137, 80], [-65, 73, 26, -131, -123, 5, 79]]