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.
2, 9, ['s', '5049', 'T', 'X', '7313', '7955', '5533', '9849', '887', '6969', 'L', 'X', '3617', '4115', 'o', '7863', '6375', '7607', '4671', '7731', 'v']