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]: 5, 6, ['F', 'u', '4899', 'P', '2029', 'A', '9641', '8201', 'e', 'g', 'Y', '3483', 'y', '6515', 'S']
[EX A]: 2029

[EX Q]: 4, 7, ['7463', '6237', 'v', '9817', '969', '6317', 'N', 'k', '2023']
[EX A]:
17103