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.
7, 20, ['1001', '5067', '1357', '7655', '9667', '4493', '5507', '1715', 'a', '915', 'n', '4575', 'N', 'b', '6827', '6985', 'd', '6267', 'd', '9307', '1459']