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.
[[22, -143, -57, 16], [-8, -157, 41, -14, 32, -120], [-59, -61, 90, -32], [39, -35, -29, 72, 47, -82, -159], [74, -88], [-95, -198, 2], [-80, -64, -40], [21, 38]]