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: 5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']

Output: 7896


Input: Consider Input: 2, 3, ['u', '7053', '303', '329', 'D']

Output: 7356


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


Output: 8814