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.
13, 25, ['C', '675', 'v', '2455', '8371', '4285', '7879', 'X', 'n', 'c', '2833', 'r', 'r', 'n', 'e', '8963', 'j', '7667', 'c', '2639', 'Z', 'a', 'v', 'P', '4431', 'g']