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:
[[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]

Ex Output:
[65, 75, 21, 82, 4, -3, 21]


Ex Input:
[[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

Ex Output:
[38, 80, 94, 31]


Ex Input:
[[-20, -179, -88, 59, 58], [-105, 92], [6, -127, -64, -103, -71], [-83, -166, -112], [-56, -56, -147, 90, -157, -130, -150], [-145, -99, 85, -117, -53, -111]]

Ex Output:

[59, 92, 6, -83, 90, 85]