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, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']
203

7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']
6189

14, 21, ['1831', 'P', '8503', 'q', 'G', '5613', '1107', 'R', '3001', 'l', '279', '3061', 'w', 'Z', 'i', '9445', 'J', 'D', '5627', '2877', 'v', 'K', '4911', 's', '5083']

17949