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]: 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, 11, ['R', 'k', '4813', '655', '3185', 'M', '4199', '1857', '9829', '6389', 'X', '3405', 'P', 'x']
[EX A]: 30927

[EX Q]: 2, 10, ['801', 'o', 'z', 'D', 'D', 'W', 'Y', '4653', 'w', '2397', '3725', '6485', 'A', '7077']
[EX A]:
7050