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]: 13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']
[EX A]: 1667

[EX Q]: 2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']
[EX A]: 1351

[EX Q]: 8, 22, ['h', '1765', 'j', 'V', '4219', 'M', 'j', '1593', '1531', 'X', 'E', 'g', 'B', 'A', 'o', 'S', 'P', '3149', 'N', 'j', '4267', 'p']
[EX A]:
10540