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.
12, 19, ['B', 'a', '379', 't', 'x', '1081', '4697', '4667', '6991', '9561', '6831', 'w', '9839', '1907', 'J', '9997', 'u', 'H', 'k', '4575', 'M', '7619', 'I', 'G', '8387', '3299']