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:
[[-166, 3, -5, -99, -138, -161], [-57, -150, -165, -173, -42, -119, 15], [-56, -79, -48, 17], [-18, 57, -129, -20, -99, -111], [-120, -191, -196, -30], [-163, -24, 56], [-196, -8, 84, 62, -45, -19, 77], [63, -18, 37]]

Ex Output:
[3, 15, 17, 57, -30, 56, 84, 63]


Ex Input:
[[-45, 100, 36, -80, 90], [-117, 80, -105, 86], [45, -168, -148, 87, -195, -102]]

Ex Output:
[100, 86, 87]


Ex Input:
[[-40, 93, -195, -83, 47, -77], [-11, -173, 36, -40, -94, -147, -77], [96, -105, -121, -200, -183], [-38, -12, -159, -129, -149, -137], [2, -25, -180, 90, 20, -50], [-94, 23, -23, -68], [-51, 35, 68, 59, -70, -15, -67], [-165, -63], [-193, -187, -7, -98, 21, -84, 79]]

Ex Output:

[93, 36, 96, -12, 90, 23, 68, -63, 79]