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:
[[-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:
[[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]

Ex Output:
[40, 84, 55]


Ex Input:
[[77, -10, -86, -142, 31, -199], [-101, 37], [-171, -52, -50, -135, -63], [-84, -39, -63, -110, -154, -191, -154], [-111, -117, -86, -9], [37, -38, -132], [-1, 81], [-118, -108, -85]]

Ex Output:

[77, 37, -50, -39, -9, 37, 81, -85]