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.

[Q]: 13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']
[A]: 1667


[Q]: 14, 15, ['Q', '2131', 'X', 'u', 'y', '9699', '7305', '3017', '8151', 'X', '9723', '7907', 'j', '1527', 'u', 'D', 'b', '7735', '1713']
[A]: 1527


[Q]: 18, 21, ['S', '8063', 'W', '6979', 'k', 'M', 'V', '737', 'V', 'W', '7601', 'A', '6483', 'z', '8231', 'w', 'D', '525', 'I', '2525', 'n']
[A]:
3050