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:
[[20, -141], [-153, 62, 13, -129], [-197, 78, 14, -101], [40, -136, -81, -138], [-182, 84], [47, -184, -16], [5, -28, -3, -174, -139], [91, -121, -61, 55, 42]]

Ex Output:
[20, 62, 78, 40, 84, 47, 5, 91]


Ex Input:
[[97, -79, -195, 1, -45, -140], [-172, -37, -72], [70, 17, 83, -49]]

Ex Output:
[97, -37, 83]


Ex Input:
[[-179, -23, 4, -20, 36, -38, -152], [-148, -187], [45, -20, -111, -24, -41, -133, -149], [-133, 26, -28, -46, -141, -4], [-104, -171, -189, -105, 93], [56, -134, -116], [1, -7, -123]]

Ex Output:

[36, -148, 45, 26, 93, 56, 1]