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:
[[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]

Ex Output:
[34, -30, 37, 55, 85, 61]


Ex Input:
[[-134, -117, -108, 57], [-70, 34, 52, -191]]

Ex Output:
[57, 52]


Ex Input:
[[-21, -80, -164], [48, 51, -126, 89, 57, 65, 54], [-59, -26, 75, -186], [-52, 13, -160], [-9, -53, -122], [-107, 42, -197, 85, -152, -118], [-9, -104, 11, 39, 17, -118, 5], [-191, -80, 13], [-2, -81]]

Ex Output:

[-21, 89, 75, 13, -9, 85, 39, 13, -2]