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.

Example Input: 3, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']
Example Output: 1538

Example Input: 12, 19, ['x', 'Z', 'm', '3819', 'D', 'P', '4815', 'D', 'V', '1409', 'u', 'N', 'E', 'A', 'v', 'k', '553', '1869', '6203', '803', '4061']
Example Output: 8625

Example Input: 18, 24, ['1875', '8767', 'v', '1549', '581', 'k', 'Y', 'x', '5441', '383', 'u', 'x', 'U', '8189', 'i', 'c', '7273', '2947', '6125', '4099', 'H', '9787', '9997', 'A', 'n', '1273', '9651', '1789', '5125', '2763']
Example Output:
32955