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:
[[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]

Ex Output:
[22, -12, 60, 59, -8, 90]


Ex Input:
[[-36, -152, -104, -52, 52, 6], [90, -19, -71, -183, -183, -15, -153]]

Ex Output:
[52, 90]


Ex Input:
[[-186, 56, 51, 79, -33, 73], [-7, 2], [41, 11, 48, 16, -186, -166, 3], [6, -195, -109, -68], [-28, 19, -69, -81, -25, 92, -74], [52, 15, -188, -147, 7]]

Ex Output:

[79, 2, 48, 6, 92, 52]