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:
[[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]

Ex Output:
[28, 70, 52, 63, -145, 11]


Ex Input:
[[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]

Ex Output:
[25, 59, -59, 90, 68, -84]


Ex Input:
[[-92, -69, -4, 84, 34, -181], [53, 22], [10, -21, -132, 52, -61, -143], [-93, 52, -53, 41], [81, 35, -24, -181], [-8, -124, -137, 22], [-195, 85, -133, -188, -108, 64], [-145, 50, 60]]

Ex Output:

[84, 53, 52, 52, 81, 22, 85, 60]