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:
[[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]

Ex Output:
[59, -12, -25]


Ex Input:
[[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]

Ex Output:
[-65, 43, 97]


Ex Input:
[[-197, -114, -133, -66, 88, 85], [-166, 51], [-149, 10], [-197, -58, 96, -66, 16, -85], [-197, 47, -170, 52, -4], [-54, 47, 22, -71], [-136, 43, -196, 58, -129, 63, -22], [72, -132, -92, -88, 90]]

Ex Output:

[88, 51, 10, 96, 52, 47, 63, 90]