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.

[[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]
[84, 1, 35, -78, 24, 87]

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

[[-181, -16, -23], [-167, 90], [-171, -166, -80, -138, -71, 88, -31], [-171, -68], [-41, -131, -39, -54]]

[-16, 90, 88, -68, -39]