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.
[[-15, -146, 65, 1, 46, -59], [53, 68], [-118, -116], [-90, -60, -145, 73, -118, -171], [-21, -51, -104, -168, 30, -130], [8, -54, -25, 73, 76, -123, -55], [-55, -111, 29, -109, -165, 28]]