Submit solution

Points:
15 (partial)

Time limit:
1.4s

Memory limit:
256M

Author:

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Graf has a graph, a graph with vertices and bidirectional edges. In this graph, Graf wonders: for each vertex how many vertices are within distance of it?

#### Input Specification

The first line will have space-separated , , and .

The next lines will describe the edges: there is an edge between every pair of integers on the next lines. Edges will not be repeated in the input.

of the test data will additionally have .

#### Output Specification

Output lines, the answer for vertex number on line .

#### Sample Input 1

```
6 7 1
1 2
2 3
1 4
2 5
4 6
3 4
2 6
```

#### Sample Output 1

```
3
5
3
4
2
3
```

#### Sample Input 2

```
4 6 1
1 2
1 3
1 4
2 3
2 4
3 4
```

#### Sample Output 2

```
4
4
4
4
```

## Comments

QUFor the moment, I am QUing, preventing me from making any new submissions. Is there a reason for this? Thank you!

Edit: It is all good now.

Internal Error?

Edit: nvm, it works now

Is this question solvable in python?

Test data is fixed. If you were affected by this issue, you should email the admin on finding a resolution.

In test case 2 I believe K = 0, contrary to the problem statement.

You're right. I overlooked that, sorry. It will be fixed in the final tests.