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, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']

Output: 8337


Input: Consider Input: 5, 21, ['f', 'c', 'y', '1711', '3261', 'I', '3249', 'O', '7875', 'm', '7665', '375', 'V', '4561', 'v', 'J', '2809', '2081', 'i', 'v', 'S', 'f', '8393', 'P', 'r', '4103', 'q', '1141', '9971', '671']

Output: 31876


Input: Consider Input: 10, 11, ['J', '5319', '1625', 'z', '275', 'B', '6901', 'b', 'X', '8669', '2307', '3117', 'K']


Output: 10976