1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66
67. 67
68. 68
69. 69
70. 70
71. 71
72. 72
73. 73
74. 74
75. 75
76. 76
77. 77
78. 78
79. 79
80. 80
81. 81
82. 82
83. 83
84. 84
85. 85
86. 86
87. 87
88. 88
89. 89
90. 90
91. 91
92. 92
93. 93
94. 94
95. 95
96. 96
97. 97
98. 98
99. 99

#include <algorithm>
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cstring>
#define init_io(pname) ifstream cin((string)pname+".in"); ofstream cout((string)pname+".out"); ios_base::sync_with_stdio(false); cin.tie(NULL)
#define FOR(i, a, b, in) for (int i = (a); i < (b); i += in)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b, in) for (int i = (a) - 1; i >= (b); i -= in)
#define RREP(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
#define mem(a, b) memset(a, (b), sizeof(a))
using namespace std;
typedef string str;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii; typedef pair<ll, ll> pl; typedef pair<ld, ld> pd;
typedef vector<int> vi; typedef vector<ll> vl; typedef vector<ld> vd;
typedef vector<ii> vii; typedef vector<pl> vpl; typedef vector<pd> vpd;
constexpr auto INF = (int)1e9;
constexpr auto LINF = (ll)1e18;

int N, A[100005];
vi ans;
pl seg[4 * 100005];

pl merge(const pl& a, const pl& b) {
	pl ret;
	if (a.first == b.first) ret = pl(a.first, (a.second + b.second < 0 ? LINF : a.second + b.second));
	else ret = (a.first > b.first ? a : b);
	return ret;
}

void update(int i, pl v, int l = 1, int r = -1, int n = 1) {
	if (r == -1) r = N;
	if (l == r) seg[n] = v;
	else {
		int m = (l + r) >> 1;
		i <= m ? update(i, v, l, m, n << 1) : update(i, v, m + 1, r, n << 1 | 1);
		seg[n] = merge(seg[n << 1], seg[n << 1 | 1]);
	}
}

pl query(int a, int b, int l = 1, int r = -1, int n = 1) {
	if (r == -1) r = N;
	if (l > b || r < a) return pl(0, 0);
	if (l >= a && r <= b) return seg[n];
	int m = (l + r) >> 1;
	return merge(query(a, b, l, m, n << 1), query(a, b, m + 1, r, n << 1 | 1));
}

int main() {
	init_io("itout");

	ll K;
	cin >> N >> K;
	for (int i = 0; i < N; i++) cin >> A[i];

	for (int i = 0; i < 4 * N; i++) seg[i] = pl(0, 0);

	for (int i = N - 1; i >= 0; i--) {
		pl q = query(A[i], N);
		if (q.first++ == 0) q.second++;
		update(A[i], q);
	}

	int d = query(1, N).first;
	cout << N - d << endl;
	for (int i = 0; i < N; i++) {
		pl q = query(A[i], A[i]);
		if (q.first == d) {
			if (K <= q.second) d--;
			else {
				ans.push_back(A[i]);
				K -= q.second;
			}
		}
		else ans.push_back(A[i]);
	}

	sort(ans.begin(), ans.end());
	for (auto& x : ans) cout << x << endl;
}