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.
26, 28, ['2783', '4283', 'n', '707', '8381', '1563', 'G', '7281', 'j', 'd', '8299', 'a', 'C', 'T', 'K', 'u', '5303', '6703', '2437', 'Q', 'E', '517', '8869', '8401', '2687', 'E', 'f', '8411', 'O']