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.

[[72, -110, 97, -107], [-183, 45, -32, -7, -97, -142, -6], [-47, -104, 26, -34], [-113, -140, -200, -197, -42], [-65, 45], [44, -104], [27, -69], [-64, -42, -114]]
[97, 45, 26, -42, 45, 44, 27, -42]

[[20, -141], [-153, 62, 13, -129], [-197, 78, 14, -101], [40, -136, -81, -138], [-182, 84], [47, -184, -16], [5, -28, -3, -174, -139], [91, -121, -61, 55, 42]]
[20, 62, 78, 40, 84, 47, 5, 91]

[[-63, -28, 53, -15], [-65, -114, 48], [90, 73, -156, -133, 44, -53], [73, -130, -25, 81, -170, -37], [10, 7, 30, 72, 29], [-125, -197], [-94, 61, 52, -165], [-119, 54, 58, -182, -170, 44, -139]]

[53, 48, 90, 81, 72, -125, 61, 58]