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, 12, ['o', 'D', '8707', 'X', '7943', 't', '4755', 'R', '1849', 'r', '3433', '2731', '565', 'f', '5003', '4911', '6695', '8473', '5631', 'd', 'q']