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:
[[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]
answer:
[36, 69, 66, 79]


question:
[[-144, -147, -167, -134], [-136, -155, -95, 11, 3], [21, -157, -154, -85, -48, -42], [-22, 20, 86, 45], [-121, -74], [18, -1, -80, -98], [-96, -192, -106, 81, -44, -157], [92, -40], [79, -82, -172, -123, -164, -67, 46]]
answer:
[-134, 11, 21, 86, -74, 18, 81, 92, 79]


question:
[[37, -48, -166, 26], [93, -86], [-195, -120, 41, 80, 39, 1], [-132, 35, 67, -33]]
answer:

[37, 93, 80, 67]