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:
[[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]

Ex Output:
[65, 53, 72, -30, 85, 38]


Ex Input:
[[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]

Ex Output:
[-68, 75, -10, 55, 89, 94, 52, 22, 96]


Ex Input:
[[-19, 0, -155, 46, 28], [-193, -17, -181, -67, -72, -91, -173], [-16, -121, 78, 67], [-160, -166], [90, -186, -46, -51], [-190, -17, -137, 52, -150], [-76, -71, -114, -141, -6, -143]]

Ex Output:

[46, -17, 78, -160, 90, 52, -6]