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.
[[42, -157, -118, 30, -24], [-56, -69, -124, -53, -105, 61, 65], [-144, 65, -48], [-109, 65, -18], [-129, 29, 69], [-182, 96, -98, -181, -192, -152, -155], [14, 51, 35, -101, -76, 60, -171], [-76, -197, -46, 40, 43]]