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:
[[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

Ex Output:
[87, 7, 73, 69, 96, -106, 48, 84]


Ex Input:
[[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]

Ex Output:
[-12, 8, 76, 96, -36]


Ex Input:
[[55, 67, -81, -117], [-180, 34, -167, -15, 37, -2], [27, -45, 79, 25], [-65, 42, 12, -8, -161, -167], [-192, -174, -134, 60, 55], [89, 58, -60]]

Ex Output:

[67, 37, 79, 42, 60, 89]