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]: 5, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']
[A]: 4383


[Q]: 6, 15, ['H', 'u', 'Y', 'Z', 'm', '1897', 'u', '2511', '507', '4977', '2019', '8913', 'Q', '5835', '1787', 'q', '1197']
[A]: 28446


[Q]: 2, 7, ['6541', 'Y', '2257', 'd', '365', 'a', '5509', 'j', '1229', 'D', 'K', '2335', '4627']
[A]:
8131