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.

[[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]
[92, 46, 25, 19]

[[-13, -42, 79], [10, -6, 24, -174, -92], [65, 8, -120, -166, 36], [-181, 25, -196, -180, -44], [-38, 72, 84]]
[79, 24, 65, 25, 84]

[[-4, 77, 17], [-78, -33, -55, -49, -147, -136], [-109, -131, -20], [-4, -165, -166, -72], [60, -57, 73, -192, -74], [33, -49, -157, -36, -196, -92, -63], [-111, 56, -151], [-147, -179]]

[77, -33, -20, -4, 73, 33, 56, -147]