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]: 4, 16, ['B', 'u', 'M', 'C', '9069', '815', '2175', '6087', 'o', '115', '9559', '2365', 'Z', 'e', '277', '1889', '6181', '6895', 'm']
[A]: 32351


[Q]: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']
[A]: 5085


[Q]: 1, 5, ['9587', '3727', '8337', 'D', 'v', '2381', '5323', '2843', '2659', '1151']
[A]:
21651