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, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']

A: 33375
****
Q: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']

A: 59155
****
Q: 4, 16, ['i', '8471', '3033', 'b', '2269', 'u', '4757', '2773', '69', '9489', '6595', '6805', 'z', 'Y', 'B', 'x']

A:
32757
****