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.

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']
18445

4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
6933

1, 3, ['m', '2115', '5459', 'l', '8425', 'O', 'z', '8369', '5575', '1787', 'l', 'q', '3821', '749', 'J', '6907']

7574