instruction:
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.
question:
[[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]
answer:
[41, -44, 34, 86, 26]


question:
[[-141, -120], [12, -89], [-27, -150]]
answer:
[-120, 12, -27]


question:
[[-68, -162, -135, 34, 52], [-122, -146, -114, -106], [-61, -161, 93, -10, 26, -70, -48], [-48, -80]]
answer:

[52, -106, 93, -48]