#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> P(n); for (int i = 0; i < n; ++i) { cin >> P[i]; } vector<vector<int>> sortedSubsequences; for (int i = 0; i <= n - k; ++i) { vector<int> subsequence(P.begin() + i, P.begin() + i + k); sort(subsequence.begin(), subsequence.end()); sortedSubsequences.push_back(subsequence); } int count = 0; for (int i = 0; i < sortedSubsequences.size(); ++i) { for (int j = i + 1; j < sortedSubsequences.size(); ++j) { if (sortedSubsequences[i] == sortedSubsequences[j]) { count++; break; } } } cout << sortedSubsequences.size() - count << endl; return 0; }