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: 6, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']

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

A: 45112
****
Q: 3, 12, ['5673', '4803', '303', '4489', 'w', 'J', 'j', 'z', 'q', '463', 'v', 'B', 'r', 'Y', 'F', 'Y', '9883', 'M', 'p']

A:
5255
****