Submission #69491476

---

Source Code Expand

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N,M,K = mi()
cnt = [0] * N
res = []
for _ in range(K):
    a,b = mi()
    cnt[a-1] += 1
    if cnt[a-1] == M:
        res.append(a)

print(*res)

Submission Info

Judge Result