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.
7, 13, ['z', '7855', 'J', '967', 'u', '53', 'n', '3357', '6751', '7411', 'l', '2197', '279', '6329', 'n', 'z', 'h', 'f', 'e', 't', 'c', 'b', '7443', '1203', 'U', '1541']