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, -106, -178, 55], [-140, -84, -171, -91]]

Ex Output:
[55, -84]


Ex Input:
[[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]

Ex Output:
[-53, -98, 36]


Ex Input:
[[-80, 65, -158], [40, -80, 14], [-32, -155, 50, -83, -81, -57], [23, -144, 74], [81, -19, -88, -82, -175], [-114, -129, -116, 51, -107, -84], [23, -142, -180, -34, -134, 61, 90]]

Ex Output:

[65, 40, 50, 74, 81, 51, 90]