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:
[[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]

Ex Output:
[71, 71, -38, 60, 7, 97, 76]


Ex Input:
[[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]

Ex Output:
[78, 80, 91, 99]


Ex Input:
[[-20, -27, 7, -126, -144, -74], [-13, -95, -138, 65, -68], [80, -20, -164, -194, 95], [57, -14, -25, 30, 28], [-148, -196], [-69, -4, -67, 35], [-9, -148, -2, 85, -156, 95, -155]]

Ex Output:

[7, 65, 95, 57, -148, 35, 95]