796A

#include<iostream>#include<vector>#include<string>#include<set>#include<map>#include<algorithm>#include<queue>#include<stack>using namespace std;int main(){int n, m, k;while (cin >> n >> m >> k){vector<int> prices(n + 1);for (int i = 1; i <= n; i++) cin >> prices[i];int i = m - 1;int j = m + 1;int distance = 0;while (i >= 1 || j <= n){if (i >= 1){if (prices[i] <= k&&prices[i] != 0){distance = (m - i) * 10;break;}}if (j <= n){if (prices[j] <= k&&prices[j] != 0){distance = (j - m) * 10;break;}}i--;j++;}cout << distance << endl;}return 0;}