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.

1, 6, ['B', 'N', 'b', '9383', '4711', 'K']
14094

3, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']
4295

5, 13, ['6637', '803', '3777', '9545', 'o', '3291', '4073', 'i', 'J', '3531', '7705', '5035', 'v', 'E', '551', '2877', 'm', '5699', 'c', '9969', 'u', 'R', 'q', '3303']

23635