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:
[[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]
answer:
[58, 19, 68]


question:
[[-143, 33, -146], [-82, -145, -105, -21], [0, -95, -164], [-153, 9, 51, 84, 71, -82], [5, 73, 67, -153, 11, -136], [-1, 81, -75, -41], [-102, -43, 69, -150]]
answer:
[33, -21, 0, 84, 73, 81, 69]


question:
[[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]
answer:

[90, 65, 16, 93, 30]