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: 16, 20, ['8615', '8269', 'k', 'R', 'l', '9823', '6879', '7777', 'w', '8443', 'W', '6951', 'Q', '8251', 'M', 'g', 'F', 'w', 'C', '7267', 's', '973', '4703', '8921']
Example Output: 7267

Example Input: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']
Example Output: 0

Example Input: 1, 14, ['5665', '6543', '9251', 'U', '9981', 'z', 'y', '8117', '3481', '2423', '9779', '1761', 'C', '8825']
Example Output:
65826