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.

Input: Consider Input: 3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']

Output: 40356


Input: Consider Input: 5, 11, ['P', '8565', '3357', '1049', '9881', 'V', '2119', '2447', 'M', '8017', 'N', 'n', '3913', '4271', 't', '1585']

Output: 22464


Input: Consider Input: 4, 7, ['767', '2467', '7707', '1343', '1491', '7145', '6799', '8561', 'Y', '7109', '1571', 'K', '8369', '6811', 'm', '2601', '6829', 'E', 'Y', '875', 'h']


Output: 16778