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: 6, 30, ['3625', '6111', '9137', 'g', '7241', '499', 'j', 'X', 'j', '5853', '5639', 'o', '8159', '3819', 'B', '45', '57', '7735', '6881', '4939', 'O', 'N', 'L', '3843', '8829', 'C', 'm', '5407', 'W', '8215']

69920