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]: 20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']
[EX A]: 16811

[EX Q]: 11, 13, ['O', '4429', 'F', '2013', 'v', 'p', 'y', '507', 'g', '935', '1827', 'Q', '4267', 'A', 'm', 'g', 'k', 'S', 'a', 'C', 'q', 'W', 'M']
[EX A]: 6094

[EX Q]: 20, 25, ['8561', 'f', 'T', '8367', 'H', '7951', 'r', '6345', 'I', '8779', '4945', '6437', '9823', '3335', '1377', 'O', 'O', '1679', '4871', '9891', '4637', 't', 'M', '161', '3381', 'l']
[EX A]:
18070