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.
2, 22, ['l', '2749', 'c', '2275', '5997', 'z', 'm', '909', 'o', '9217', 'b', '9331', '3', 'p', 'j', 'm', 'j', '7931', 'm', '8339', 'r', '417', 'O', '2797', 'c', '7851', 'k']