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:
[[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]

Ex Output:
[93, 57, 98, 60, 15, -64, -9]


Ex Input:
[[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]

Ex Output:
[62, 84, 96]


Ex Input:
[[-17, -110, -40, 76, -43, -13, 5], [-42, -3], [-85, 18, 25, -186], [-37, -94, -144, -193, -15, 43, 23], [0, 97, -50, -65], [-29, 98, 7, -125, -17], [-77, -143, -200, 32, -170, -154, -116], [24, -6]]

Ex Output:

[76, -3, 25, 43, 97, 98, 32, 24]