Problem: This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.

First, Aoi came up with the following idea for the competitive programming problem:

Yuzu is a girl who collecting candies. Originally, she has x candies. There are also n enemies numbered with integers from 1 to n. Enemy i has a_i candies.

Yuzu is going to determine a permutation P. A permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, \{2,3,1,5,4\} is a permutation, but \{1,2,2\} is not a permutation (2 appears twice in the array) and \{1,3,4\} is also not a permutation (because n=3 but there is the number 4 in the array).

After that, she will do n duels with the enemies with the following rules:

  * If Yuzu has equal or more number of candies than enemy P_i, she wins the duel and gets 1 candy. Otherwise, she loses the duel and gets nothing. 
  * The candy which Yuzu gets will be used in the next duels. 



Yuzu wants to win all duels. How many valid permutations P exist?

This problem was easy and wasn't interesting for Akari, who is a friend of Aoi. And Akari made the following problem from the above idea:

Let's define f(x) as the number of valid permutations for the integer x.

You are given n, a and a prime number p ≤ n. Let's call a positive integer x good, if the value f(x) is not divisible by p. Find all good integers x.

Your task is to solve this problem made by Akari.

Input

The first line contains two integers n, p (2 ≤ p ≤ n ≤ 2000). It is guaranteed, that the number p is prime (it has exactly two divisors 1 and p).

The second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 2000).

Output

In the first line, print the number of good integers x.

In the second line, output all good integers x in the ascending order.

It is guaranteed that the number of good integers x does not exceed 10^5.

Examples

Input


3 2
3 4 5


Output


1
3


Input


4 3
2 3 5 6


Output


2
3 4


Input


4 3
9 1 1 1


Output


0

Note

In the first test, p=2.

  * If x ≤ 2, there are no valid permutations for Yuzu. So f(x)=0 for all x ≤ 2. The number 0 is divisible by 2, so all integers x ≤ 2 are not good. 
  * If x = 3, \{1,2,3\} is the only valid permutation for Yuzu. So f(3)=1, so the number 3 is good. 
  * If x = 4, \{1,2,3\} , \{1,3,2\} , \{2,1,3\} , \{2,3,1\} are all valid permutations for Yuzu. So f(4)=4, so the number 4 is not good. 
  * If x ≥ 5, all 6 permutations are valid for Yuzu. So f(x)=6 for all x ≥ 5, so all integers x ≥ 5 are not good. 



So, the only good number is 3.

In the third test, for all positive integers x the value f(x) is divisible by p = 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse2")
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T>
using Table = vector<vector<T>>;
const ld eps = 1e-9;
using Graph = vector<vector<int>>;
using ll = long long;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
  os << "( " << v.first << ", " << v.second << ")";
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < v.size(); i++) {
    if (i > 0) {
      os << " ";
    }
    os << v[i];
  }
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
  for (int i = 0; i < v.size(); i++) {
    if (i > 0) {
      os << endl;
    }
    os << v[i];
  }
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<set<T>> &v) {
  for (int i = 0; i < v.size(); i++) {
    if (i > 0) {
      os << endl;
    }
    os << v[i];
  }
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &v) {
  int i = 0;
  for (auto it : v) {
    if (i > 0) {
      os << ' ';
    }
    os << it;
    i++;
  }
  return os;
}
using Value = ll;
const Value ini = -1;
ll gcd(ll a, ll b) {
  if (a % b == 0)
    return b;
  else
    return gcd(b, a % b);
}
Value connect(Value al, const Value ar) {
  if (al == -1)
    return ar;
  else if (ar == -1)
    return al;
  return gcd(al, ar);
}
Value dat[2000001];
struct segtree {
  int N;
  segtree() {}
  segtree(int n, vector<Value> &v) {
    N = 1;
    while (N < n) N *= 2;
    for (int x = 0; x < N; ++x) {
      if (x < v.size()) {
        dat[x + N - 1] = v[x];
      } else {
        dat[x + N - 1] = ini;
      }
    }
    for (int x = N - 2; x >= 0; --x) {
      dat[x] = connect(dat[x * 2 + 1], dat[x * 2 + 2]);
    }
  }
  void update(int k, const Value &a) {
    k += N - 1;
    dat[k] = a;
    while (k > 0) {
      k = (k - 1) >> 1;
      dat[k] = connect(dat[k * 2 + 1], dat[k * 2 + 2]);
    }
  }
  int query(int a, int b, int va) { return query(a, b, 0, 0, N, va); }
  int query(int a, int b, int k, int l, int r, int va) {
    if (r <= a || b <= l) return 0;
    const int m = (l + r) / 2;
    if (a <= l && r <= b) {
      if (dat[k] % va == -1 || dat[k] % va == 0)
        return 0;
      else {
        if (l + 1 == r)
          return 1;
        else {
          int l_cnt = 1, r_cnt = 1;
          if (dat[2 * k + 1] == -1 || dat[2 * k + 1] % va == 0) l_cnt = 0;
          if (dat[2 * k + 2] == -1 || dat[2 * k + 2] % va == 0) r_cnt = 0;
          if (l_cnt + r_cnt >= 2)
            return 2;
          else {
            if (l_cnt == 0) {
              return query(a, b, k * 2 + 2, m, r, va);
            } else {
              return query(a, b, k * 2 + 1, l, m, va);
            }
          }
        }
      }
    }
    return query(a, b, k * 2 + 1, l, m, va) + query(a, b, k * 2 + 2, m, r, va);
  }
};
using ll = long long int;
int main() {
  int N, P;
  cin >> N >> P;
  vector<int> v(N);
  for (int i = 0; i < N; ++i) {
    scanf("%d", &v[i]);
  }
  sort(v.begin(), v.end());
  vector<int> oks(N + 1);
  vector<map<int, int>> mps(P);
  int ok_min = 0;
  for (int i = 0; i < N; ++i) {
    int x = v[i];
    ok_min = max(ok_min, x - i);
  }
  ok_min = max(ok_min, 0);
  for (int i = 0; i < N; ++i) {
    int num = upper_bound(v.begin(), v.end(), ok_min + i) - v.begin() - i;
    int al = (P - num) % P;
    if (al < 0) al += P;
    int rest = i - al;
    if (rest >= 0) {
      int ar = al + rest / P * P;
      mps[(ok_min + al) % P][ok_min + al]++;
      mps[(ok_min + al) % P][ok_min + ar + P]--;
    }
  }
  for (int i = 0; i < P; ++i) {
    mps[(i + ok_min) % P][ok_min + i + P] += 100000000;
  }
  vector<int> answers;
  for (int i = 0; i < P; ++i) {
    int sum = 0;
    for (auto it = mps[i].begin(); it != mps[i].end(); ++it) {
      sum += it->second;
      if (sum > 0) {
        int al = it->first;
        int ar = (next(it) == mps[i].end()) ? al + int(1e6) : next(it)->first;
        for (int x = al; x < ar; x += P) {
          answers.push_back(x);
        }
      }
    }
  }
  sort(answers.begin(), answers.end());
  {
    vector<int> answers2;
    for (int i = ok_min; i <= ok_min + N; ++i) {
      if (!binary_search(answers.begin(), answers.end(), i)) {
        answers2.push_back(i);
      }
    }
    answers = answers2;
  }
  cout << answers.size() << endl;
  for (auto ans : answers) cout << ans << ' ';
  cout << endl;
  return 0;
}