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, 6, ['7073', '3047', 'O', 'c', 'u', 'G']
[A]: 0


[Q]: 6, 27, ['O', '4985', '525', 'U', 'B', '4689', 'u', '2891', 'A', 'O', 'u', 'T', 'Z', '81', '9747', 'O', '2135', 'U', '8637', '3927', 'X', 'z', 'W', 'h', '6347', 'L', 'c', 'H', 'q']
[A]: 38454


[Q]: 13, 21, ['i', 'f', 'w', 'c', 'N', 'b', 'v', 'c', '2685', 'Q', '7881', '8079', 'O', '3351', 'I', 'a', '855', 'n', '3159', 'p', 'W', '1179', '3495', '4323', 'G', '4239', '1157', '9017', 'g']
[A]:
7365