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]: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']
[A]: 5121


[Q]: 2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
[A]: 22725


[Q]: 8, 22, ['x', 't', '5401', 'o', '9693', 'b', 'U', 'e', 'K', '6495', '3805', '5225', '8133', '5105', '2025', '1709', '6717', '1157', '6583', 'c', 'h', '4761', 'F', 'C', '4739', '8779', '2589', 'v']
[A]:
51715