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, 7, ['7999', '9549', '8299', 't', '9311', '2385', 'B', 'x', '565', 'C', '6531', 'A', '5949', 'H']
[EX A]: 37543

[EX Q]: 5, 7, ['t', 'e', 'P', 'H', 'I', 'U', 'a', '8147', 'i', 'D', 'x', 'x', 'i', 'm', '4893', '6443', '8841', 't', '4641', '9415', '1965', '673']
[EX A]: 0

[EX Q]: 2, 8, ['c', '6297', 'Y', '6953', 'F', '9261', 'v', '1217', 'S', '7885', '2717', 'O', 'j', 'e']
[EX A]:
23728