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, 8, ['O', 's', '3399', '1813', 'T', '4477', '7161', 'z', '1173', 'Y', '6051', '7509', 'i', '9765', '809', '6191', 'f', '1983', 'm', '1043', '8465', '9511', 'i', 'p', '4891', 'K', 'W', 'W', '239']
[A]: 16850


[Q]: 3, 4, ['4845', '7313', 'P', 'A', '2285', 'C', 't']
[A]: 0


[Q]: 14, 23, ['L', 'd', '3499', 'Q', '4593', '5943', 'R', 'Z', '3193', '8625', '2887', '1621', 'z', 'G', 'l', 's', '6465', '9811', '861', 'u', '5081', '6173', '3457', '3809', 'd', '4189', 'H', 'U', 'W']
[A]:
31848