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: 4, 4, ['2107', 'l', '7551', '4907']

Output: 4907


Input: Consider Input: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']

Output: 5430


Input: Consider Input: 2, 10, ['p', 'r', '2955', 'K', '5907', 'B', '6769', '6531', '3249', '8651']


Output: 34062