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, 17, ['1217', '5039', 'b', '6417', '9971', '5963', 'K', '4441', 'B', 'j', 'm', 'G', 's', '3441', 'c', 'L', 'b', '7569', '8601', 'f', 'X', 'v', '1057', '3833']