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: 2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']

A: 12269
****
Q: 1, 2, ['E', 'z']

A: 0
****
Q: 7, 9, ['E', 'n', '6917', '1131', '1599', '1643', 'V', 'Y', '5353', '7171', '2413', '6543', 'a', '5879', 'A', '7001', 'c', '8049', '1445', 'N', '5381', 'v', '2991', '9175', 'l', '9589', '9213', '5873', '7897']

A:
5353
****