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: 1, 2, ['1811', 'K', '3343', 'e']
Example Output: 1811

Example Input: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']
Example Output: 0

Example Input: 9, 16, ['4313', '579', 'o', 'S', '4589', '1419', 'S', '6395', 'H', 'P', 'T', '1389', '2561', '143', '7377', 'q', '5383', '1843']
Example Output:
11470