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, 6, ['u', 'L', 'm', '9283', 'e', '4615', '7815', '7185', 'h', 'h', '8985', '3987', '1521', 'k', '5715', 'd', 'w', 'T']
[EX A]: 13898

[EX Q]: 1, 1, ['R', '3969', 'O', '3281', 'X', '5173', 'K', 'G', 'm', 'Y', '4981', 'x', '9127', 'X', 'w', 'm', '3873', '5887', '7405', 't', 'P', 'K', '8459', '9699']
[EX A]: 0

[EX Q]: 8, 22, ['593', '5911', 'r', 'z', 'Q', 'K', '7301', 'J', '973', '3891', 'c', '7119', 'D', 's', '3423', '4383', 'c', 'A', 's', '7307', '5825', 'k']
[EX A]:
32921