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:
[[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]

Ex Output:
[53, 34, 91, 40]


Ex Input:
[[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

Ex Output:
[-3, 50, -38, 51, 42, 54, 81, 76]


Ex Input:
[[55, -127, 86, 26, -42, -15, -2], [24, 94, -157], [57, 0, -66, -191, -72], [-65, -10, -200, 57, 1], [-118, -138, -3, 58, 92]]

Ex Output:

[86, 94, 57, 57, 92]