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.
13, 13, ['6759', 'S', '4553', 'm', '2801', 'v', '9127', 'a', 'u', '1875', '721', '613', 'D', '5521', 'm', 'G', 'b', 'h', 'c', '5965', '6357', '7435', '1819', 'd']