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]: [[65, 72, -140, -53, -102, -66, -171], [36, -50], [-166, 32, 12, -43], [-129, 2, -49], [-172, -124, 44, -100, -133], [89, -95, 52, 45, -102, -4]]
[A]: [72, 36, 32, 2, 44, 89]


[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]: [[5, -16, -154], [-38, -13, -20, -138, -175, -87], [36, -110], [-102, -175], [26, -58, 82, -39, 2, -28, -169], [-175, -193, 7, -63, -187, -183], [-193, -108, -65, -3, -72, -50, 50], [-87, 90, -48, -122], [-59, 16]]
[A]:
[5, -13, 36, -102, 82, 7, 50, 90, 16]