In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
27, 27, ['M', 'B', 'U', '1031', 's', '5995', '4213', 'E', '6053', '9391', '1587', '9097', 'A', '4665', '3979', 'b', 'O', '209', '8533', '3785', '1329', '667', 'a', 'd', 'b', 'n', 'r']