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: 15, 24, ['987', '1799', 'q', '4969', '7401', 'M', '1637', '423', 'D', '2883', 'O', '5667', 'z', 'k', '6791', 'O', 'o', '4693', '6961', 'E', 'k', 'm', 'g', 'O', '7131', 'I', '7671']

Output: 18445


Input: Consider Input: 4, 12, ['2337', 'A', 'j', 'p', 'c', 'k', 'Y', 'Q', 'N', 'L', '8857', '9985', 'N', 'x', 'u']

Output: 18842


Input: Consider Input: 19, 25, ['2619', 'X', 'f', '5559', 'h', 'u', '5849', '1339', 't', 'Y', '6351', '1051', '8811', 'v', 'G', '3985', 'u', 'r', '5607', '5723', 'B', '9075', '5797', '4855', 'e', '8917', '2213', 'r']


Output: 31057