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]: 2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
[A]: 22725


[Q]: 4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']
[A]: 20400


[Q]: 7, 17, ['4043', 'M', 'X', 'O', 'b', '2557', '2323', 'Z', '6913', 'm', 'G', 'o', 'E', '7723', 'U', '3623', 'h', 'B', 'P', '1707', '3713', '7799', 'i', '2679', '8013', 'H', 'e', '5425']
[A]:
20582