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:
[[31, 44], [13, -22, 72, 55, -34], [-27, 78, 59, 91, -145], [14, -162, -184, -161, -77, -168, -99], [-136, 28, 56, -45, 85], [-29, -101, 59, 6, 99, -113], [81, 42, -55]]

Ex Output:
[44, 72, 91, 14, 85, 99, 81]


Ex Input:
[[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]

Ex Output:
[55, 51, 83, 61, -9, 67, 15]


Ex Input:
[[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]

Ex Output:

[86, 23, 78, 68, -116, 72, 55, 53]