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]: 28, 29, ['9439', '4749', 'b', '5065', 'W', '3631', '4647', '2367', '7155', 'X', 'R', '7889', '3135', '5547', 'C', 'j', 'b', 'e', 'U', 'Y', '8799', 'z', 'h', '7759', '1913', '6103', 'y', 'M', 'B']
[A]: 0


[Q]: 10, 16, ['V', 'b', '2575', '385', 'U', 'I', 'Y', '2647', 'V', 'k', '6379', 'W', '1883', 'n', 'K', '3001', '6791', 'I', '4285', 'f', 'i']
[A]: 11263


[Q]: 2, 12, ['4761', '6485', '1653', '1181', '8561', '6803', 'k', '5837', 'y', 't', 'f', '9089', '291', '8283', 'Q', '5827', 'f']
[A]:
39609