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: 3, 24, ['I', '9141', 'U', 'W', '2533', '6157', '9569', 'N', 'n', '8041', '6907', '1411', 'G', 'n', 'F', '2317', '8247', '5179', '8551', '7379', '7913', '8277', '7125', 'F', 'x', '8023', 'k', '5283', '9939']

89606