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, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']
[A]: 2957


[Q]: 1, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']
[A]: 9035


[Q]: 2, 2, ['2245', 'f', 'W', 'Y', 'D', 'G', 'W', 'p', '4525', '4977', '4173']
[A]:
0