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:
[[21, -143, 100, -121, 53], [-196, 60, 71], [-71, 38, -90, -65, -98], [-76, -31, -114, 10, -102, -81, 11], [-132, -94, -171, -142, -1, -80, -90], [8, -113, 13], [-114, 79], [-142, -194, -116, -90, 30]]

Ex Output:
[100, 71, 38, 11, -1, 13, 79, 30]


Ex Input:
[[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]

Ex Output:
[38, 25, -7, 1, 40, 92, 87, 76, -95]


Ex Input:
[[-55, 30, 57, -185], [-5, -160, 25, -33, -165, 91], [21, 88, 61, -35], [-132, -31], [-199, -188], [-71, 18, 36, 93, -31, -41, -48], [-62, -53, 37, -72], [-189, -74], [-106, -96, -24, -11, -90, 7]]

Ex Output:

[57, 91, 88, -31, -188, 93, 37, -74, 7]