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.

10, 16, ['Q', '931', 'P', '6777', 'X', '3855', 'i', '1055', 'd', 'p', '7947', 'z', 'X', 'h', 'g', 'w', 'r', 'T']
7947

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

6, 12, ['j', 'e', '4627', 'g', '3499', '5503', 'h', '3129', 'E', '4329', 'u', 'T', '867', '7859', 'n', 'N', 'v', 'y', 'e', 'x', 'Q', '7227', '225', '9095', 'c', 'K']

12961