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:
[[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

Ex Output:
[38, 80, 94, 31]


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

Ex Output:
[90, -4, 18]


Ex Input:
[[14, -86, 26, -114, 51, -10, -44], [-179, -97, -100, 92, 12, -131], [80, -9, 12, -100, -187, -7], [-130, -185, 22, 57]]

Ex Output:

[51, 92, 80, 57]