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.

Example Input: 3, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']
Example Output: 1538

Example Input: 4, 5, ['1427', '7597', '765', 't', '7057', 'f', 'B', 'k']
Example Output: 7057

Example Input: 12, 25, ['j', '8835', 'w', '1403', 'I', '257', '243', 'R', 'P', '3987', '5847', 'T', '2025', '7', 'y', 'l', 'v', 'J', '2923', '1121', 'b', 'F', 'H', 'l', '5777', '3297', 't', 'r', '4841', 'U']
Example Output:
11853