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: 4, 6, ['4301', 'a', 'E', '3709', '5105', 'B']
Example Output: 8814

Example Input: 6, 20, ['x', 'z', '271', 'M', '1727', '9453', '4017', 'o', '8109', 'X', '5989', '275', 'V', '3019', 'Z', 'K', 'L', '3885', '8699', '6241']
Example Output: 49687

Example Input: 4, 10, ['7995', 'N', '7797', '7999', '8821', 'c', 'Z', 's', 'd', 'n', 'V', '5699']
Example Output:
16820