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:
[[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]

Ex Output:
[93, 17, 78, 84, 35]


Ex Input:
[[66, 10, -186, -151, 34], [-114, -68, 3, 78, 23, 38], [-153, -6, -141, -166, -95], [42, -169, -55, -76], [-115, -122, -102, -107, 66], [42, -166, -186, -46, -174, -89]]

Ex Output:
[66, 78, -6, 42, 66, 42]


Ex Input:
[[-127, -140, 79, -157, -164], [2, -48, -195, -195, 39, 59, -71], [71, -55, -84, -39, -162, -116, -198], [-64, 44, -33, -130, 3, 91], [-197, -129, -112, 53], [6, -21, -21, 96, -113], [-196, 28, 70, -24, 74, 5]]

Ex Output:

[79, 59, 71, 91, 53, 96, 74]