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:
[[-26, 54, 36], [-50, 30, -14], [-156, -199, 52, -83, 10], [-97, -59], [-14, 5, -188, -55, 74, -190], [43, -5, 14, 28, -77, -186, -74], [-200, -151], [-162, 64]]

Ex Output:
[54, 30, 52, -59, 74, 43, -151, 64]


Ex Input:
[[-118, -187, -142], [-109, 9, 28, -68, -102, -54, -86], [8, 13, -12, -184, -136, -66, -149], [-183, 61, -145, -4, 1, -119], [-82, -101, 28, -172, 75, 75], [-19, -193, -76, 35, -160, -140, 10], [-110, -165, 51]]

Ex Output:

[-118, 28, 13, 61, 75, 35, 51]