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, 13, ['8663', 'o', '9939', '8125', '9523', 'R', '9245', 'D', 'T', 'd', 'O', 'Q', '4721', 'H', '7541', 'J', '8389', 'F', '9915', '221', '889', '3345', '7919', 'u', 'F', 'a', '31', 'H', 'U', 'X']