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, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
Example Output: 6933

Example Input: 20, 21, ['3975', '2459', 'X', '337', 'X', '5453', '9019', 'O', '4911', '1019', 'y', 'D', 'K', 'W', 'v', '2479', 'a', 'o', '4867', '9195', '3269']
Example Output: 12464

Example Input: 7, 23, ['9549', 'N', '2945', '5879', 'r', 's', 'P', '1', '7105', 'o', '7245', '8605', '5259', '3725', 'V', 'J', '8141', '4211', 'S', 'G', '2299', '789', '639', 'f', '3503', '6569', '7701']
Example Output:
48019