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, 7, ['6997', '3987', '2463', 'm', 'W', 'R', 'a', 'U', 's', 'Y', 'X', '4193', '343', 'Y', '4277', 'n', 'W']
[A]: 0


[Q]: 2, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']
[A]: 12664


[Q]: 2, 4, ['1399', 'P', 'O', 'm', 'S', '6515', '7947', 'y', '7493', '5307', 'm', '8697', '5059', '7961', 'F']
[A]:
0