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: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']

Output: 5085


Input: Consider Input: 4, 6, ['4301', 'a', 'E', '3709', '5105', 'B']

Output: 8814


Input: Consider Input: 9, 28, ['c', '2063', 'K', 'r', 'X', '7497', 'C', '8941', '6573', 'E', '1977', '5289', '2387', 'E', 'x', 'w', '913', '4069', 'f', 'u', 'n', '6021', '4155', '5619', '6699', '4507', '3357', 'n', '8435']


Output: 51566