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.

Ex Input:
[[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]

Ex Output:
[90, -4, 18]


Ex Input:
[[-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]]

Ex Output:
[86, 23, 78, 68, -116, 72, 55, 53]


Ex Input:
[[-131, 33, 62, 95, 78], [39, -186], [52, -148, -84], [4, -81], [-61, -162, -164], [-47, 40, -158, 38, 52, 44, -139]]

Ex Output:

[95, 39, 52, 4, -61, 52]