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:
[[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]

Ex Output:
[-57, 95, 65, -1, 100, 55, 31, 94]


Ex Input:
[[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]

Ex Output:
[51, 49, 86, 66, 74, -151, 49, 25]


Ex Input:
[[-52, -190, -123, 20], [-181, -69, -161, -170, 18], [-72, -84, 83, 18, 22, -27, 76], [-145, 79, -134, -73]]

Ex Output:

[20, 18, 83, 79]