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, 22, ['6267', '5681', 'P', 'X', '4621', '7515', 'L', 'm', '4683', 'G', '5153', 'f', 'r', 'm', 'j', 'C', 'P', 'R', '521', 't', '2277', '9197', 'p', '6441']