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.

[Q]: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]
[A]: [-76, -61, 22, 62]


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


[Q]: [[-37, -114, -133], [-146, -83, 62, -177, -99, -185], [8, -168, 37, 53, -134]]
[A]:
[-37, 62, 53]