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.
9, 12, ['5333', '4625', '6523', '2959', 'j', 'X', '8841', 'l', 'I', 'u', '4125', '9691', 'V', 'e', 'w', '841', 'g', '8809', '1437', '3699', '761', '1517', 'x', '779']