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.
10, 15, ['8875', 'n', '5449', 'l', 'b', '835', 'K', 'f', '2677', '7457', 'M', '9437', '3589', 'p', 'P', 'X', 'W', '4033', 'M', 'H', 'Z', '2313', 'o', 'h', 'V']