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]: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']
[EX A]: 20863

[EX Q]: 25, 26, ['9367', 'G', 'c', '4997', 'g', 'r', '2893', 'T', '6693', 'I', '5127', 'N', '4333', '6905', '8539', 't', 'y', 'f', '8341', 'e', 'g', '8749', '3525', 'g', '6263', '321']
[EX A]: 6584

[EX Q]: 5, 7, ['6017', 'F', '1077', 'i', '2789', '1295', 'h', '6633', '1575', 'C', 'Q', '231', '9391', 'V', 'Y', 'S', '9469']
[EX A]:
4084