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: 2, 16, ['2169', 'o', 'D', '8877', '3351', 'p', 'X', '1143', '9633', 'f', '2507', 'S', '5541', 'B', '4543', 'A', 'f']
Example Output: 35595

Example Input: 4, 5, ['677', '5585', 'W', 'J', 'C']
Example Output: 0

Example Input: 1, 2, ['9621', '3231', '5905', 'M', '3233', 'j', '2449', '3805', '4923', '235', '407', 'w']
Example Output:
12852