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.
[[-118, -187, -142], [-109, 9, 28, -68, -102, -54, -86], [8, 13, -12, -184, -136, -66, -149], [-183, 61, -145, -4, 1, -119], [-82, -101, 28, -172, 75, 75], [-19, -193, -76, 35, -160, -140, 10], [-110, -165, 51]]