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.
5, 21, ['8563', 'v', 'y', '4363', '9837', '6357', '289', 'V', 's', 'G', 'F', '8287', 'V', 'x', '8173', '9787', 'o', '6827', 'v', '1165', '2179', 'C', '971', '7899', '1899', 'f', 'j', 'x', 'V', 'X']