[SWEA] 전기버스 (Python)

T = int(input())
for test_case in range(1, T + 1):
    k, n, m = map(int, input().split()) #0번에서 출발해서 n번까지 이동, 최대이동 k,
    num_station = list(map(int, input().split()))
    stations = [0]*(n+1)
    
    for num in num_station:
        stations[num] += 1
    prev = pres = count = 0
    pres += k
    
    while True :
        if pres >= n :
            break
            
        if stations[pres] == 1 :
            count +=1
            prev = pres
            pres += k
        
        else :
            pres -= 1
            if prev == pres :
                count = 0
                break
       	
    print("#{} {}".format(test_case, count))