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.
[[57, -185, -1], [51, -184, -171], [34, -53, -105, -170, -140], [-76, -142, -81, 83, -138, -24, -93], [-122, -170, -44], [27, -13], [-196, -163], [28, 66, -153, -22, -170, 19], [37, -183]]