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, 20, ['7991', '1029', 'L', '3307', 'A', '6641', '8833', 'J', '2751', '7457', 'f', '943', 'D', '5609', '5123', '5561', 'N', '1755', '1117', 'C', 'k', '6657', '2569']
[EX A]: 50126

[EX Q]: 15, 23, ['z', '4587', '8709', '977', 'J', '823', '6437', '3817', 'X', '399', '2265', '3001', '5997', '3393', 'o', '6551', '7305', '9007', '7931', '8235', 'k', 'l', '1523']
[EX A]: 40552

[EX Q]: 1, 24, ['2227', 'z', 'z', 'B', 'g', '5857', 'L', '9077', '4227', '7487', 'E', 'c', 'M', '7683', 'O', 'a', '3641', 'j', 'G', 'x', '4217', 'r', '1627', '5171', 'M']
[EX A]:
51214