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.
[[28, 97, 80, -6, -24, 80, -129], [71, -161, 32, -189, 7, -140, -156], [2, 12, 44, 65, -10, 69, -121], [100, -52, -116, -174, -130, 82], [-101, -49, -35, -23, -101, -86], [-135, 32], [-199, -161], [34, 30, 68, -51, -162], [-78, -176]]