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:
[[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]
answer:
[47, 58, 99, -57, 92, -77, 30, 0, -38]


question:
[[5, -85, -188], [44, -175, 17, 82, 16], [-91, -101], [-172, -71, -147], [-90, 46, -27, 25, -122], [-23, -83], [-70, -18, 68, -98, -130, -177, -131]]
answer:
[5, 82, -91, -71, 46, -23, 68]


question:
[[-84, -46, 27, -71, 12], [-160, -56, -151, -113, 26, -35, -77], [-129, -94, 37, -155], [-99, -109, -117, -185, -141], [5, -198, -119, -32, -100, -61]]
answer:

[27, 26, 37, -99, 5]