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.
1, 12, ['1467', 'X', '3331', 'k', '3849', 'E', 'i', 'R', '6891', 'C', '7167', '5139', 'o', 'W', 'h', '6449', '2645', 'c', 'K', 'x', '5015', '8063', '6377', '7491', 'S', '3745', '3751']