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: 16, 18, ['o', '3669', 'M', 'M', 'R', 'r', 'o', 'P', 'q', '9939', '1807', 'F', 'J', 'a', '7773', 'I', 'A', '475', 'W', 'E', '417']

A: 475
****
Q: 9, 10, ['G', '4305', '8949', '5591', '3373', '175', 'L', 'A', '6849', '8549', '1931']

A:
15398
****