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.

Q: 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']

A: 18445
****
Q: 2, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']

A: 16174
****
Q: 1, 2, ['6387', '5679', 'K', 'z', '2483', '335']

A:
12066
****