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]: [[-27, -95, -24, 21, -4], [-82, 46, 70, -26, -123, 20], [49, -103, 64], [-107, -168, 6, 38, -46], [-180, -187, 64], [-105, -27]]
[A]: [21, 70, 64, 38, 64, -27]


[Q]: [[-181, -180, 67, -144, 81], [-111, -185, -90, -148], [-57, 8, -160, -124, -144], [-127, 69, -3, -93, -101], [57, -173, 91, -38], [-75, -50, 8, 83]]
[A]: [81, -90, 8, 69, 91, 83]


[Q]: [[28, -83, -54, -90, -137, 19, -28], [7, -81, 18, -115, -101, 38], [74, -196, -26, 73, 33], [46, -62, 41, -18, -104], [-91, -106, 53, -72, 26, 73, -185], [36, -190, 8, -51], [-155, -106]]
[A]:
[28, 38, 74, 46, 73, 36, -106]