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: 4, 5, ['b', 'u', '5279', '6945', '6631']

Output: 13576


Input: Consider Input: 6, 20, ['x', 'z', '271', 'M', '1727', '9453', '4017', 'o', '8109', 'X', '5989', '275', 'V', '3019', 'Z', 'K', 'L', '3885', '8699', '6241']

Output: 49687


Input: Consider Input: 4, 6, ['A', 'v', 'q', 'K', '6679', '6639', '5851', 'Y', '6361', '3043']


Output: 13318