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.
[[-146, 11, -6, 51, 91, -37, 52], [-144, 80, 99, -38], [-145, -132, 95, -31], [92, 84, -108, -180, -44, 78], [-51, -27, -152, -114, 75, -53], [-31, 19, -171, 19, 38], [-123, 56, -40, -22], [96, 8]]