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:
[[-106, 56, 90, 76, 6, -169], [-10, -187, 27, 59, 94, 85]]

Ex Output:
[90, 94]


Ex Input:
[[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]

Ex Output:
[44, -43, 93, 23, 9]


Ex Input:
[[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]

Ex Output:

[25, 59, -59, 90, 68, -84]