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.
8, 13, ['q', '4001', '1797', '8313', '939', '9839', '1897', '6669', '9667', '9505', '4039', 'v', '5379', '2329', 'j', 'Z', 'N', '7271', 'J', 'j', 'r']