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.

[[-60, -15, -145, -17, -184, -199], [-146, -105, 64, -192, -170, 17, 69]]
[-15, 69]

[[-35, -168], [73, -23, -44, -109], [-90, 58, -47, 56], [-27, -102, -149, -183, 72]]
[-35, 73, 58, 72]

[[39, 76, 61, -184, -79, 60, -114], [100, 25, -135, -119, 8], [-69, 76, 75, 17, -48], [-6, 4, -142], [-54, 75, -144, 86, -4], [57, 97, -41, 7, -24, 22, -76], [98, -167, -145], [25, 21, -55, 95, -183]]

[76, 100, 76, 4, 86, 97, 98, 95]