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.

[[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]
[98, 56, 93, 13, 28, 59, 74]

[[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]
[25, 32, 86, 96, -33, 84, 93]

[[18, 60], [71, -5, -152, -90, 52], [30, -121, 47, 12, 34, -110], [-19, -154], [-112, 36, -85], [-106, -168, -3, 43, -95, -163, -161], [-166, -68, -17, -90, -197, -191]]

[60, 71, 47, -19, 36, 43, -17]