The story was not finished as PMP thought. God offered him one more chance to reincarnate and come back to life. But before he can come back, God told him that PMP should ask n great men including prominent programmers about their life experiences. The men are standing on a straight line. They are numbered 1 through n from left to right. The coordinate of the i -th man is x i ( x i < x i + 1 , i < n ) . PMP should visit all these people one by one in arbitrary order. Each men should be visited exactly once . At the beginning of his tour, he starts at location of s -th man and asks him about his experiences. Each time PMP wants to change his location, he should give a ticket to an angel and the angel carries him to his destination. Angels take PMP from one location, fly to his destination and put him down there. Nobody else is visited in this movement. Moving from i -th man to j -th man, takes | x i - x j | time. PMP can get back to life as soon as he visits all men. There are two types of angels: Some angels are going to the right and they only accept right tickets. Others are going the left and they only accept left tickets. There are an unlimited number of angels of each type. PMP has l left tickets and n - 1 - l right tickets. PMP wants to get back to life as soon as possible to be able to compete in this year's final instead of the final he missed last year. He wants to know the quickest way to visit all the men exactly once. He also needs to know the exact sequence moves he should make. The first line of input contains three space-separated integers n , l , s ( 2 ≤ n ≤ 10 5 , 0 ≤ l < n , 1 ≤ s ≤ n ) — the number of people to visit, the number left tickets PMP got, and initial location of PMP. Next line contains n space-separated integers. The i -th integer in this line is x i ( 0 = x 1 < x 2 < ... < x n ≤ 10 9 ) — the location of i -th man. If PMP cannot visit all men with the tickets he got print -1 in the only line of output. Otherwise, in the first