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.
3, 22, ['N', 'L', '6649', '1325', 'a', 'G', '6907', 's', '7389', '2157', 'x', '8129', 'p', 'c', '6597', '3533', '7815', '5799', '7477', 'Z', '5049', '3405', '9999', 'T', '3171']