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: 1, 6, ['1529', '2989', 'T', '8059', 'f', 'j', 'x', '2209']

A: 12577
****
Q: 1, 3, ['g', 'g', 'K']

A: 0
****
Q: 2, 6, ['645', '4369', 'b', '4963', 'p', 'N', '4807', '8277', 'j', 'c', '6547', 'X']

A:
9332
****