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: 1, 2, ['9621', '3231', '5905', 'M', '3233', 'j', '2449', '3805', '4923', '235', '407', 'w']

Output: 12852


Input: Consider Input: 3, 4, ['1809', '1127', 'm', '3137']

Output: 3137


Input: Consider Input: 4, 8, ['1199', 'P', 'J', 'C', '1039', 'A', '5303', 'H', '8115', '2357']


Output: 6342