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:
[[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]

Ex Output:
[85, -8, 67, 45, 71, 91]


Ex Input:
[[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]

Ex Output:
[35, -69, -81, 92, 91, 58, 48, -41]


Ex Input:
[[-196, -46, -36, 29], [63, -170, 83, -44, -136, -92, 78], [-23, -147, -90, -70], [-81, 33, 38, -194], [-80, 44], [77, -9, -187, -177, -172], [18, -24]]

Ex Output:

[29, 83, -23, 38, 44, 77, 18]