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]: 7, 17, ['n', '1023', '2743', 'r', '5855', 'd', '4425', '3381', 'x', '9609', 'f', 'o', '8513', 'e', '7331', 'N', '7949', 'O']
[A]: 41208


[Q]: 5, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']
[A]: 19814


[Q]: 9, 13, ['2619', 'o', '1347', 'a', '6905', 'c', '6897', '9101', 'v', 'L', '9257', '7623', '7381', 'h', '9393', 'T', '4593', '8403', 'Q', '9807', 'L', 'D', '5049', 'p', '3005']
[A]:
24261