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: 4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']

A: 3201
****
Q: 8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']

A: 3932
****
Q: 5, 29, ['7693', '6743', '7743', 'c', '2067', '8141', '4241', 'J', 'P', 'N', 'J', '2483', '6689', 's', '8649', 'R', 'Z', 'v', 'a', 'O', 'N', 'T', '9439', '739', 's', 'Y', 'S', 'q', 'P']

A:
42448
****