Definition: 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.
Input: 5, 21, ['h', '5369', 'B', '1175', '4661', '4057', '6671', '1991', 's', 'E', '6833', 'a', 'F', 'Q', 'F', 's', '2639', '3621', 'G', 'n', '8965', '7777', '4221', 'q', '6649', 'R', 'f', '9851', 'm', 'g']

39438