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.

[[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]
[2, 72, 60]

[[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]
[-66, -6, 91, 69, -24, 72]

[[76, -48, -81, 74], [-83, 10, -154, -49], [-141, 85], [-91, -48, -114, -130, -37, 80, -63], [16, -67, -159, -24], [-94, 97, 6, -199, -183], [-57, -67, 40]]

[76, 10, 85, 80, 16, 97, 40]