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]: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]
[A]: [-16, 68, 80, -85, -15, 94, 69]


[Q]: [[79, -185, 24], [38, 8, 46, 27, -43, -100]]
[A]: [79, 46]


[Q]: [[-96, -61, -173, 41, -50], [-181, -21, -194, -153, -166, -154], [-49, 11, -28]]
[A]:
[41, -21, 11]