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, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']

Output: 1538


Input: Consider Input: 5, 6, ['937', '3595', '1279', '8705', '3587', '5879']

Output: 9466


Input: Consider Input: 2, 7, ['7747', '1203', '9475', '9565', '2867', 'Z', '6263', '1273', '4455']


Output: 29373