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.

[Q]: [[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]
[A]: [-137, 8, 71, 30, 12]


[Q]: [[-45, -38], [-74, -64, -89], [-113, 74, 59, -86], [28, 57, -77, -99, 95], [-193, -88, -89, 85]]
[A]: [-38, -64, 74, 95, 85]


[Q]: [[-4, 26], [-189, -190, 60, 7, 28], [-1, -18, 68, -182, -86, -26, -6], [-156, -101, -137, -34, 30, -113, -68], [96, -106, 39], [-56, -144, 95, 28], [-89, -186, 49, -159]]
[A]:
[26, 60, 68, 30, 96, 95, 49]