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, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']

A: 2957
****
Q: 3, 17, ['T', 'j', '9425', '2255', '8915', '7957', 'U', '5987', '9461', 'A', 'g', 'n', 'F', '637', '475', 't', 'y']

A: 45112
****
Q: 5, 22, ['9569', 'v', 'D', 'T', 'A', '2357', '5813', 'n', '6151', 'D', '5471', 'J', 'c', 'S', 'l', '7567', 'Y', '1135', 'p', 'E', 'Y', '7951', 'D', 'x', '957', '7985', '7643', 'O', 'B', 'E']

A:
36445
****