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: 8, 8, ['9433', '6635', 't', '4425', 'R', '5893', 'z', 'P', 'V', 'f']
Example Output: 0

Example Input: 9, 9, ['V', 'x', '3763', '8367', '3369', '6695', 'p', 'P', 'L', 'g', 's', '5117', 'n', '5097', '2407', '6337', '5437', 'o', '3023', 'D', 'g']
Example Output: 0

Example Input: 9, 10, ['7773', '597', 'z', '8987', '3877', '9383', '4257', '5843', '3401', '8187', 'n', '7231', '4801', 'y', '2607', '5081', '573', '6097', 'y', '4059']
Example Output:
11588