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]: 15, 21, ['w', 'R', '9247', '5745', '5397', 'U', 'R', 'e', '8067', 'e', '2851', 'O', 'F', '4705', '5393', 'q', 'b', 'J', '211', '4319', 'o', 'h', 'Z', '4423', 'j', '2691', 'U']
[A]: 9923


[Q]: 4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']
[A]: 25920


[Q]: 2, 11, ['1863', 'd', '6261', '1767', 'Y', 'F', 'p', '8679', 'A', 'n', '925', 'y', 'h', 'A', '1195', 'v', '6681', '9053', '3605', 'k', 'I', '5421', 'T', 'v', '133', 'm']
[A]:
17632