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, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']
[EX A]: 5231

[EX Q]: 1, 15, ['t', '77', '6593', '3683', '5673', '9391', 'Y', 'A', '3273', '379', '6569', 'l', 'u', '8633', 'M', '8587', '3127', '5885', '4083']
[EX A]: 44271

[EX Q]: 1, 12, ['7893', 'G', 'C', '599', '207', 'Y', 'B', '2317', 's', '8343', '9917', 'L', 'd', '3355', '549', '7407', 'v', '5513']
[EX A]:
29276