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: 16, 29, ['1431', 'a', '7223', '5743', '4571', 'q', 'Z', '3415', '6237', '1537', '5403', 'Y', 'K', '1949', 'p', '2641', '3307', 'X', 'O', 'q', 'T', 'n', '845', '1489', '161', '8515', '8735', '5065', '4973', '9287']

A: 35731
****
Q: 1, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']

A: 30959
****
Q: 1, 2, ['g', '7507', '8969', '5361', 'O', 'A', '6779']

A:
7507
****