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.
[[-54, -91, -146], [8, -118, -123, -155, -61, -123, -133], [89, 79, -186, -130, 67], [-187, -47, -156, -68, 59, -39, -198], [53, 5, -99], [20, -136, 24, -31, -149, -14], [-43, -40], [-62, -79, 44, 47, -190, -156]]