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, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']

Output: 8825


Input: Consider Input: 1, 2, ['E', 'z']

Output: 0


Input: Consider Input: 1, 8, ['b', 'w', '3319', '3301', '8043', 'k', 'k', '2609', '6271']


Output: 17272