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]: 3, 5, ['u', 'Y', '4165', '1421', '7617']
[A]: 13203


[Q]: 11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']
[A]: 6609


[Q]: 5, 8, ['9817', 'Q', 'W', '6741', '4543', '3105', 'B', 'B', 'E', '5087', '1923', '9841', 'I', '2211', '9157', '9483', '5153']
[A]:
7648