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.
1, 13, ['4141', '3613', '8991', '3679', '4157', 'V', 'X', 'o', 'U', '4999', 'z', 'l', 'd', '1063', 'S', 'H', 'c', 's', '1241', 'J', '1659', 'q', 'E', '9409', 'U', 'n']