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.
11, 23, ['4479', 'c', 'k', 'p', 'x', 'F', '4587', 'C', '6073', '6745', 'G', 'P', 'G', '4259', '7063', 'H', '6127', '7101', 'U', '3701', 'X', '5835', '8343', 'd', 'B', 'G', 'j']