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:
[[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

Ex Output:
[14, -86, 34, 47, -117]


Ex Input:
[[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]

Ex Output:
[-6, -59, 52, 14, 96, 37, 62]


Ex Input:
[[-25, -18, 39, -83, -179, -115], [-159, -54], [-150, 34, 18, -102, 24, -89, -29], [90, 36, -32]]

Ex Output:

[39, -54, 34, 90]