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.
19, 21, ['Z', 'b', '539', 'M', 'C', '4177', '9287', '3655', 'L', '8061', '7959', 'r', 'v', 'H', '539', '5379', 'R', 'C', '2335', '2853', '7537', 'P']