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, 6, ['7073', '3047', 'O', 'c', 'u', 'G']
0

10, 13, ['W', '5479', 'v', '2193', '8465', '3805', 'e', '7721', '983', 'i', '7843', '6803', '9901', 'K', '375', '165', 'M', 'P', 'a', 'J']
24547

12, 26, ['1855', 'k', '1783', '8619', '9263', 'p', 'P', '2009', '1865', '5259', 'P', 'y', 'r', '6107', 'M', 's', '4135', 'U', '6007', '3879', '7625', 'c', 's', 'l', 'x', '7177', 'O', 'q', '7399', '3025']

34930