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.
6, 14, ['2279', '667', 'F', '1543', '1165', '3425', 'g', 'R', 'C', 'x', 'o', '125', 'd', '563', '8383', '4827', 'I', '4963', '4761']