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: 2, 2, ['V', 'a']

Output: 0


Input: Consider Input: 1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']

Output: 25374


Input: Consider Input: 1, 1, ['169', '7255', '8719', '3339', '3435', '7999', 'R', 'U', '3789']


Output: 169