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, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']

A: 8063
****
Q: 10, 12, ['h', 'C', 'q', '7869', 'S', '2545', '3607', '8257', '165', '6373', 'X', '2481', 'a', '5803', '9191', 'v', 'c', 'k', '8077']

A: 8854
****
Q: 2, 8, ['4517', 'w', '9145', '5477', '7679', 'j', '8603', 'z']

A:
30904
****