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, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

Output: 4477


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

Output: 7356


Input: Consider Input: 14, 21, ['j', '4161', 'R', 'J', 'k', '7071', 'W', '9269', '2327', '7929', '5419', 'V', '3493', '9985', 'x', '2153', 'B', 'q', 'w', 'B', 'e', '7187', 'h', '4067']


Output: 12138