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, 19, ['B', '5683', '6425', 'k', '5543', 'v', '2511', '8397', 'v', '6341', '7565', '4639', 'n', 'y', 'u', '4845', '8313', 'u', 'f', 'Y', 'u', 'I', '219', 'U']