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.

[[11, 10, -180, -124, -192, 98], [86, -172, -162]]
[98, 86]

[[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]
[57, 80, -20, -50, 8, 64]

[[-54, -137, 99, -26], [-25, 92, -125, -152, 86, -29, -111], [-3, 67, -31, -83, 36, -42, 64], [57, -174, -176, -96, -179, -147, 90], [75, -153, -95, -8, -28], [76, -51, -101, -188, -91], [-166, 51, -31], [-148, -139, -69, 41], [-152, -96, 50]]

[99, 92, 67, 90, 75, 76, 51, 41, 50]

