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.
[[34, 13, -17], [-7, -151, -40, 78], [-199, 16, 80, -63, -167], [-23, 89, -19, 13, -156], [-42, -42], [-8, -25, 95, -62, 66, 100, 8], [-106, 21, -102], [-121, -75, -144, -162]]