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.
4, 15, ['3215', '7605', '5945', '6149', '6069', '951', 'l', 'R', 'B', '501', 'Q', '4919', '9647', 'R', 'g', 'c', 'y']