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, ['j', '3613']

Output: 3613


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

Output: 9466


Input: Consider Input: 3, 26, ['Y', 'F', '4491', '7773', '7521', '2815', 'r', '5425', '2201', '8485', '9161', '3125', '5729', '1635', '8865', 'f', '9015', 'F', 'K', 'u', '923', '8049', '111', 'c', '1283', '6439', 'P', '1941', '1683']


Output: 93046