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.

Input: Consider Input: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']

Output: 6095


Input: Consider Input: 4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']

Output: 20400


Input: Consider Input: 3, 12, ['7929', '1225', 'u', 'q', 'b', 'K', '2633', 'i', '8613', '1169', 'q', 'z', '7219', 'I', '6729', 'z', '2569', '3175', 'H', '7429']


Output: 12415