Problem: The new pedestrian zone in Moscow city center consists of n squares connected with each other by n - 1 footpaths. We define a simple path as a sequence of squares such that no square appears in this sequence twice and any two adjacent squares in this sequence are directly connected with a footpath. The size of a simple path is the number of squares in it. The footpaths are designed in a such a way that there is exactly one simple path between any pair of different squares.

During preparations for Moscow City Day the city council decided to renew ground tiles on all n squares. There are k tile types of different colors, numbered from 1 to k. For each square exactly one tile type must be selected and then used to cover this square surface. To make walking through the city center more fascinating, it was decided to select tiles types for each square in such a way that any possible simple path of size exactly k contains squares with all k possible tile colors.

You need to find out whether it is possible to place the tiles this way or not.

Input

The first line contains two integers n, k (2 ≤ k ≤ n ≤ 200 000) — the number of squares in the new pedestrian zone, the number of different tile colors.

Each of the following n - 1 lines contains two integers v_i and u_i (1 ≤ v_i, u_i ≤ n) — numbers of the squares connected by the corresponding road.

It's guaranteed, that it's possible to go from any square to any other square, moreover there is exactly one such simple path.

Output

Print "Yes" if it is possible to assign tile colors this way and "No" otherwise.

In case your answer is "Yes", print n integers from 1 to k each, the color of the tile for every square.

Examples

Input


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


Output


Yes
1 1 2 3 4 1 1


Input


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


Output


No

Note

The following pictures illustrate the pedestrian zone in first and second examples. The second picture also shows one possible distribution of colors among the squares for k = 4.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int head[200010], to[200010 << 1], nxt[200010 << 1], tot;
char *p1, *p2, buf[100000];
int rd() {
  int x = 0, f = 1;
  char c =
      (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
           ? EOF
           : *p1++);
  while (c < 48) {
    if (c == '-') f = -1;
    c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++);
  }
  while (c > 47) {
    x = (((x << 2) + x) << 1) + (c ^ 48),
    c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++);
  }
  return x * f;
}
inline void add(int x, int y) {
  to[++tot] = y;
  nxt[tot] = head[x];
  head[x] = tot;
}
int line1 = 1, line2 = 1, n, k;
int dep[200010], line[200010], f[21][200010], dep_f[200010], tmp[200010],
    ans[200010];
bool L[200010];
void dfs_init(int p, int fa) {
  f[0][p] = fa;
  dep_f[p] = dep_f[fa] + 1;
  for (int i = 1; i <= 20; i++) {
    f[i][p] = f[i - 1][f[i - 1][p]];
  }
  for (int i = head[p]; i; i = nxt[i]) {
    if (to[i] != fa) {
      dfs_init(to[i], p);
    }
  }
}
void dfs_find_line(int p, int fa) {
  dep[p] = dep[fa] + 1;
  for (int i = head[p]; i; i = nxt[i]) {
    if (to[i] != fa) {
      dfs_find_line(to[i], p);
    }
  }
}
int getlca(int x, int y) {
  if (dep_f[x] < dep_f[y]) {
    swap(x, y);
  }
  for (int i = 20; ~i; i--) {
    if (dep_f[f[i][x]] >= dep_f[y]) {
      x = f[i][x];
    }
  }
  if (x == y) {
    return x;
  }
  for (int i = 20; ~i; i--) {
    if (f[i][x] != f[i][y]) {
      x = f[i][x];
      y = f[i][y];
    }
  }
  return f[0][x];
}
void find_line() {
  dfs_find_line(1, 0);
  for (int i = 1; i <= n; i++) {
    if (dep[line1] < dep[i]) {
      line1 = i;
    }
  }
  dfs_find_line(line1, 0);
  for (int i = 1; i <= n; i++) {
    if (dep[line2] < dep[i]) {
      line2 = i;
    }
  }
  int lca = getlca(line1, line2);
  int now = line1;
  while (now != lca) {
    line[++line[0]] = now;
    now = f[0][now];
  }
  line[++line[0]] = lca;
  now = line2;
  while (now != lca) {
    tmp[++tmp[0]] = now;
    now = f[0][now];
  }
  for (int i = tmp[0]; i; i--) {
    line[++line[0]] = tmp[i];
  }
  for (int i = 1; i <= line[0]; i++) {
    L[line[i]] = true;
  }
  for (int i = 1; i <= line[0]; i++) {
    ans[line[i]] = i % k;
  }
}
int dep_check[200010], mx_check[200010];
void dfs_check(int p, int fa) {
  dep_check[p] = dep_check[fa] + 1;
  mx_check[p] = dep_check[p];
  for (int i = head[p]; i; i = nxt[i]) {
    if (to[i] != fa && !L[to[i]]) {
      dfs_check(to[i], p);
      mx_check[p] = max(mx_check[to[i]], mx_check[p]);
    }
  }
}
bool check() {
  for (int i = 1; i <= line[0]; i++) {
    dfs_check(line[i], line[i]);
    if (min(i - 1, line[0] - i) + mx_check[line[i]] >= k &&
        mx_check[line[i]] > 1) {
      return false;
    }
  }
  return true;
}
void dfs(int p, int fa, int opt) {
  ans[p] = (ans[fa] + opt) % k;
  ans[p] += k;
  ans[p] %= k;
  for (int i = head[p]; i; i = nxt[i]) {
    if (to[i] != fa && !L[to[i]]) {
      dfs(to[i], p, opt);
    }
  }
}
void work() {
  for (int i = 1; i <= line[0]; i++) {
    if (i - 1 <= line[0] - i) {
      (ans[line[i]] += 1) %= k;
      dfs(line[i], line[i], -1);
    } else {
      (ans[line[i]] += k - 1) %= k;
      dfs(line[i], line[i], 1);
    }
  }
}
int dep2[200010];
void dfs2(int p, int fa) {
  dep2[p] = dep2[fa] + 1;
  for (int i = head[p]; i; i = nxt[i]) {
    if (to[i] != fa) {
      dfs2(to[i], p);
    }
  }
}
int main() {
  n = rd(), k = rd();
  for (int i = 1; i < n; i++) {
    int x = rd(), y = rd();
    add(x, y);
    add(y, x);
  }
  if (k == 2) {
    puts("Yes");
    dfs2(1, 0);
    for (int i = 1; i <= n; i++) {
      if (dep2[i] & 1) {
        printf("1 ");
      } else {
        printf("2 ");
      }
    }
    puts("");
    return 0;
  }
  dfs_init(1, 0);
  find_line();
  if (!check()) {
    puts("No");
    return 0;
  }
  work();
  puts("Yes");
  for (int i = 1; i <= n; i++) {
    printf("%d ", ans[i] + 1);
  }
  puts("");
  return 0;
}