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.
2, 21, ['d', '3283', 'x', '8103', '4313', 'L', 'D', '2973', '601', '5473', 'l', 'd', '3127', '3167', 'V', 'a', '9987', '7569', '5261', '7267', '453', 'W', '1175', 'B', 'q', '4703', '9865']