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]: 18, 24, ['3493', 'T', '2499', 'l', '543', 'Y', '2247', '2665', 'y', 'z', 'a', 'H', '1057', '2401', '5587', 'w', 'N', 'n', 's', 'H', 'u', 'N', '757', 'u', 'R']
[A]: 757


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


[Q]: 17, 21, ['7037', '9447', 'f', 'R', '1237', '5735', '1327', '1371', 'd', '3025', 'B', '9165', '3447', '6135', '3315', 'l', '8069', 'g', 'H', 'e', '4523', '3149', 'H', 'o', '3947']
[A]:
12592