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.

Example Input: 1, 15, ['p', 'N', '7935', '1649', '1509', 'N', 'q', 'L', '1917', '9753', 'C', '6387', '4037', 'D', '1099', '5329', '1703', '7715', 'c']
Example Output: 34286

Example Input: 17, 18, ['449', '4995', 'M', '245', 'i', '6859', 'A', '3527', '7063', 'l', '2869', 'Z', '8739', '7057', '4815', '3263', 'P', 'l', '393', 'P', '1701', '5135', 'G', 'O', 'y', 'o', '3815']
Example Output: 0

Example Input: 10, 12, ['l', '8039', 'L', '145', '2043', '8711', 'q', 'Y', '309', 'R', 'e', 'Z', 'm', 'v', 'S', '2463', 'V', '3523', 'y', '8479', 'n', 'V', '581', 'Q', '3503', 'h', 'a', '5975', '7399', 'K']
Example Output:
0