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: 1, 1, ['1449', '1257']

Output: 1449


Input: Consider Input: 11, 25, ['Q', 'L', 'A', 'p', 'P', 'a', 'I', '6591', 'v', 's', '4785', 'S', 'm', '547', 'N', '6443', 'p', '6989', 'V', '4409', 'x', 'm', 'Q', '2887', 'Z', 'P', 'w']


Output: 26060