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:
[[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]

Ex Output:
[73, 26, 81, 48, 31, 25, 44, 31]


Ex Input:
[[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]

Ex Output:
[98, -44, 98, 19, -1, 50, 98, -17, 48]


Ex Input:
[[-149, -195], [-141, -140, -174, -112], [-109, 78, -172, -117], [77, -54, -14], [-62, -145, 31, -36]]

Ex Output:

[-149, -112, 78, 77, 31]