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, 17, ['4455', 'h', 'P', 'T', '4149', '6079', 'p', 'n', 'y', '3683', 'V', '4711', '1609', 'S', 'D', 'X', '9981', 'l', '7345', 'W', '3719', '8953', 'n']