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.

[[79, -185, 24], [38, 8, 46, 27, -43, -100]]
[79, 46]

[[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]

[[26, -72, -35, 52], [-50, -3, -33, 1, -168, -93, 8], [-110, -45], [32, -36, -6, -22], [-197, 45, 50], [-50, -54], [21, 58, -149, 3, -94], [-88, -73, -104, -62, -162, 66], [-120, 53]]

[52, 8, -45, 32, 50, -50, 58, 66, 53]