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.
7, 28, ['R', 'E', 'I', '7545', 'x', 'G', '891', 'a', 'e', 'T', 'n', '6385', '6673', 'G', '1085', 't', 'Z', 'Y', 'o', 'M', 'Q', '9545', '2247', 'P', '8725', '9515', 'l', '3145']