import sequtils,algorithm,strutils,intsets,tables,sugar template times*(n:int,body) = (for _ in 0.." .} proc scan(): int = while true: let k = getchar_unlocked() if k < '0': break result = 10 * result + k.ord - '0'.ord let n = scan() let m = scan() let k = scan() let ABC = newSeqWith(m,(a:scan(),b:scan(),c:scan())).sortedByIt(it.c) var oks = initIntSet() for i in 1..n: oks.incl i k.times: var nexts = initIntSet() let d = scan() let iMin = ABC.binarySearch(d,(x,y)=>x.c-y) for i in iMin..