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, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']

A: 9035
****
Q: 14, 14, ['a', 'i', '5431', 'U', '9109', 'm', 'H', '7643', '127', 'a', 'S', '4285', '5625', '5479', '6409', 'U', 'n', 'R']

A: 5479
****
Q: 7, 20, ['T', '7159', 'O', '2755', '4837', '6611', 'r', '1921', 'E', '3127', '8335', 'O', '5059', 'g', 'i', '2995', 'B', '2863', 'j', 'B', '4201', '2027', '2251']

A:
24300
****