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, ['C', '7921', 'r', '3093', '1917', '6641', 'T', '5385', '6165', 'S', 'l', 'Z', 't', '9875', '2851', 'I', 'H', 'o', '7917', '6783', '5091', '5757', 'M', 'q']