CF224B Array

You've got an array $ a $ , consisting of $ n $ integers: $ a_{1},a_{2},...,a_{n} $ . Your task is to find a minimal by inclusion segment $ [l,r] $ $ (1

The first line contains two space-separated integers: $ n $ and $ k $ ( $ 1

Print a space-separated pair of integers $ l $ and $ r $ ( $ 1

In the first sample among numbers $ a_{1} $ and $ a_{2} $ there are exactly two distinct numbers. In the second sample segment $ [2,5] $ is a minimal by inclusion segment with three distinct numbers, but it is not minimal in length among such segments. In the third sample there is no segment with four distinct numbers.