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]: 6, 27, ['O', '4985', '525', 'U', 'B', '4689', 'u', '2891', 'A', 'O', 'u', 'T', 'Z', '81', '9747', 'O', '2135', 'U', '8637', '3927', 'X', 'z', 'W', 'h', '6347', 'L', 'c', 'H', 'q']
[EX A]: 38454

[EX Q]: 2, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']
[EX A]: 34470

[EX Q]: 6, 28, ['6487', '8013', 'r', 'k', 'G', 'J', '6319', 'V', 'E', '493', 'Y', 'F', 'V', '9313', 'a', '8567', '6545', 'w', '3517', '7183', '195', 'z', '3245', '7525', '4645', '5995', '4661', '7031', 'Y', '901']
[EX A]:
75234