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:
[[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]
answer:
[63, -33, 43, 68]


question:
[[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
answer:
[27, 65, -27, -9, -26, -33]


question:
[[-88, 43, -34, -163], [-96, -169, -113], [27, 39, -125, -176, -61, -13, -154], [-120, 53, 81, -2]]
answer:

[43, -96, 39, 81]