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:
[[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]

Ex Output:
[-63, 82, 79]


Ex Input:
[[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]

Ex Output:
[47, 58, 99, -57, 92, -77, 30, 0, -38]


Ex Input:
[[-76, -128, 80, -132, -15], [-123, -90, -123, -78, -78, 13, 34], [55, -96], [-157, -182, 2, -23, 79, 62], [19, 56], [30, -92, -4, -56, -41, -158, 100], [44, -107, -107, -180, 50, -81]]

Ex Output:

[80, 34, 55, 79, 56, 100, 50]