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, 15, ['p', 'N', '7935', '1649', '1509', 'N', 'q', 'L', '1917', '9753', 'C', '6387', '4037', 'D', '1099', '5329', '1703', '7715', 'c']

A: 34286
****
Q: 2, 4, ['X', 'o', '8807', 'r', 'q', '825']

A: 8807
****
Q: 2, 6, ['F', '1103', '6747', 'l', '6661', '8991', 'j', 'K']

A:
23502
****