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: 11, 13, ['O', '4429', 'F', '2013', 'v', 'p', 'y', '507', 'g', '935', '1827', 'Q', '4267', 'A', 'm', 'g', 'k', 'S', 'a', 'C', 'q', 'W', 'M']

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

A: 45112
****
Q: 5, 8, ['6317', '5497', 'j', 'O', '4929', 'U', 'C', '7067', 'f', 'r', 'u', 'Z', 'I', 'b', 'q', '6681', '8335', '1021', 'M', '7785', '6347', '5101', 'c', '1003', '257', 'v', 'r']

A:
11996
****