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.

[[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]
[18, 79, 47, 72]

[[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]
[86, 23, 78, 68, -116, 72, 55, 53]

[[-191, -109, 7, 57, -130], [-30, -132, -105, -45, 74, -66, 25], [-39, -79, -68], [-33, -186, 28, -154], [-85, 92, 44, -111, 23, -84], [46, -144, 24, 73, 92], [-20, -169, -48, -20, 53, 28, -146]]

[57, 74, -39, 28, 92, 92, 53]