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, 5, ['6621', 'A', '3201', '9737', '7957', 'v', 'x', 'q', 'b', 'X', 'v', 'B', 'h', '3985', 'M', '3037', 'V']
Example Output: 20895

Example Input: 1, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']
Example Output: 0

Example Input: 10, 15, ['9817', 'j', '5605', '8151', '5371', '1327', '223', '6913', '7575', 'D', '6915', 'w', '7047', 'i', '8715', 'd', '4325', 'R', 'i', '5365', '1195', 'y', 'V', 'H', '6817', '147', 'd', 'P', '3341', 't']
Example Output:
22677