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.
12, 25, ['w', '5213', 'g', 'j', 'X', '5597', '8403', 'N', '1551', '955', 'Y', 'P', 'e', '479', 'N', '2143', '7735', 'f', '5253', 'p', 'Y', 'v', 'd', '3007', 'c']