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.
[[63, -44, -23], [-142, 61, -17], [-161, -196, -113, -49, 3, -130, -176], [-114, -19, -51, -46, -14], [-110, -110, 30, 32, 63, 26], [-103, 25, 30, -43, -187]]