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.

[EX Q]: 1, 14, ['n', 'v', '7825', '5951', 'k', '1733', 'c', 'u', 'C', 'c', 'D', 'g', '9231', 'G']
[EX A]: 24740

[EX Q]: 8, 22, ['h', '2971', 'l', 'F', 'e', 'f', 'b', 'I', 'b', '4759', 'm', 'w', '6179', 'R', '2875', '3469', '3801', 'm', '6987', 'A', 'c', '6303', '8135', 'c']
[EX A]: 34373

[EX Q]: 1, 16, ['A', '2837', '4891', '6031', 'G', 'C', 'J', 'Y', 'E', 'R', 'R', '6147', 'p', 'A', 'n', '391', '7425', '4399', 'Y', 'f', 'R', '3013', '8095', '6841', 'o', 'w', 'l', 'j', '8097']
[EX A]:
20297