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]: 5, 9, ['X', '6543', '1123', '5967', 'x', '9197', '2865', 'r', 'V', 'c']
[EX A]: 12062

[EX Q]: 3, 4, ['v', 't', '4357', '1303']
[EX A]: 5660

[EX Q]: 9, 13, ['1045', '3411', '1113', '1365', '4607', '3897', 'N', '6517', '7489', '7329', 'y', 'r', 'R']
[EX A]:
14818