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:
[[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]

Ex Output:
[38, 98, 39, 24, -38, 1]


Ex Input:
[[-120, 64, 10, -43], [-7, -30, -37, -45, 4, -185], [-17, 44, -62, -97, -5, 10, -20], [7, 91, -56, 24], [-138, -169, -139, -172, 57, -53], [62, 31, 12, 20, -182, -188, -198], [-45, -3, -11, -187], [-10, -200, -76, -160, -151]]

Ex Output:
[64, 4, 44, 91, 57, 62, -3, -10]


Ex Input:
[[85, -171, -80, 10, -43, -176, -159], [-57, -22, 6, -141, -161], [-183, 91, 9, -21, 75, -105, -151], [-80, -75, -184, -114, -37], [-146, -79, -129]]

Ex Output:

[85, 6, 91, -37, -79]