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]

[[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]
[-33, 49, 37, -34, 92, 57, 19, 72, -92]

[[14, -169, -12, -133, -67], [97, -113, -73, 28, -108, -25, -67], [7, -124, -134, 55, -161], [60, -12, 24]]

[14, 97, 55, 60]