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:
[[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

Ex Output:
[92, 46, 25, 19]


Ex Input:
[[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]

Ex Output:
[-6, 51, 71, 98, -30, 26]


Ex Input:
[[-30, -183, 65, 64, 89, -154], [34, 99, -38, -78, -7]]

Ex Output:

[89, 99]