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]: [[-198, -26], [-126, -188], [-169, 5, -181, 23, -158], [-175, 64, -109, -107, 95, 44, -7], [-118, -66, 100, 24], [13, -90]]
[A]: [-26, -126, 23, 95, 100, 13]


[Q]: [[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]
[A]: [42, -49, 94, 89, -73, 5, -41, 89]


[Q]: [[-29, -198, -188, -90, 19, -26], [-121, 14, -115], [-115, 8, 9, -43, -90, -7], [31, 69, -149, 54, -161, -175]]
[A]:
[19, 14, 9, 69]