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]: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]
[A]: [38, 80, 94, 31]


[Q]: [[-32, -76, -121, -152], [-72, -164, -165], [-56, 43], [38, -76, 59]]
[A]: [-32, -72, 43, 59]


[Q]: [[44, -195], [-58, -131, -19, -154], [16, -73, -84, -152, 60, -34], [-188, -150, -154, -7, 13, -189], [30, -81, -73, 79, 81, -73]]
[A]:
[44, -19, 60, 13, 81]