l = list(map(int,input().split()))
l2 = list(map(int,input().split()))
state = []
cur = l[0]
for i in l2 :
if i <= cur :
for j in range(i,cur+1):
state.insert(0,i)
cur = i-1
print(*state)// https://codeforces.com/problemset/problem/415/A
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, b[101], a;
memset(b, 0, sizeof(b));
cin >> n >> m;
while (m--)
{
cin >> a;
for (int i = a - 1; i < n; i++)
{
if (b[i] == 0)
b[i] = a;
else
break;
}
}
for (int i = 0; i < n; i++) {
cout << b[i] << " ";
}
return 0;
}1183A - Nearest Interesting Number | 1009E - Intercity Travelling |
1637B - MEX and Array | 224A - Parallelepiped |
964A - Splits | 1615A - Closing The Gap |
4C - Registration System | 1321A - Contest for Robots |
1451A - Subtract or Divide | 1B - Spreadsheet |
1177A - Digits Sequence (Easy Edition) | 1579A - Casimir's String Solitaire |
287B - Pipeline | 510A - Fox And Snake |
1520B - Ordinary Numbers | 1624A - Plus One on the Subset |
350A - TL | 1487A - Arena |
1520D - Same Differences | 376A - Lever |
1305A - Kuroni and the Gifts | 1609A - Divide and Multiply |
149B - Martian Clock | 205A - Little Elephant and Rozdil |
1609B - William the Vigilant | 978B - File Name |
1426B - Symmetric Matrix | 732B - Cormen --- The Best Friend Of a Man |
1369A - FashionabLee | 1474B - Different Divisors |