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:
[[-117, -166, 78, 98, 72, -44, -59], [-181, 57, -154, -50, -195, -14], [-73, -73, -10, -118, -7, -121, 95], [99, 66], [68, -97, -20, 87, 67], [76, -170, 56, 32, -95, 41]]

Ex Output:
[98, 57, 95, 99, 87, 76]


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:
[[-160, -54], [-47, 14, -86], [-119, -98, -94, -182, 32, -136, 94], [-81, -166, -29, -47, -163, -48], [-183, 56, -187, -28, 57, 7, -73], [-3, -45, -73, -126, -147], [-161, -38, 75, 56], [-163, -135], [11, -30, 43, -85]]

Ex Output:

[-54, 14, 94, -29, 57, -3, 75, -135, 43]