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, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']
Example Output: 0

Example Input: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']
Example Output: 4477

Example Input: 3, 17, ['8603', '6703', '4553', 'q', '897', '7703', '5861', 'R', 'F', 'U', 'i', 'e', 'D', '2073', 'Z', 'W', '5609', 'B', '9453', '105', 'R', 'p']
Example Output:
26696