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.
15, 27, ['7939', '1001', 'B', 'L', 'M', '1885', '4839', 'P', 'T', '3575', '2163', 'l', '2663', '3387', 'x', 'b', 'F', 'E', 'K', 'D', 'f', '9945', '6889', 'y', '5561', 'v', 'A', '1455']