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, 12, ['7315', '6433', 'u', '5003', 'i', 'k', 'F', '7269', 'n', 'd', 'h', '8193', 'N', '651', 'L', '3545', '9917', 'C', 'u', 'B', 'S', 'D', '1175', 'o']