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, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']
[EX A]: 123

[EX Q]: 11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']
[EX A]: 6609

[EX Q]: 22, 25, ['N', 'X', 'd', '273', '5357', '8485', '9909', 'h', 'y', 'R', 'e', '9845', 'F', '911', '3461', '9903', '5699', '1511', '6955', '5791', '5893', 'y', '4973', 'a', '7543', '4559', '697']
[EX A]:
12516