//
//  main.cpp
//  scmax
//
//  Created by Darius Buhai on 10/11/2018.
//  Copyright © 2018 Darius Buhai. All rights reserved.
//

/*
 
 5|24 12 15 15 19
 1 3 2 2 1
 
 dp[i] = dp[i+1]
 maximul de la j la n
 
 ex2:
 7 10 9 4 12 9 11 4 49 2 15
 4 5  3 4 2  3  2 1  1 2  1
 
*/

#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n, x, p[100001], s[100001];
//deque<int> sec;

int cautare(int x, int n)
{
    int l = 0, r = n;
    while(l<=r)
    {
        int m = (l+r)/2;
        if(x>s[m])
            return m;
        if(s[m] > x)
            r = m - 1;
        if(s[m] < x)
            l = m + 1;
    }
    return 0;
}

int main() {
    int maxi = 0;
    fin>>n>>x;
    for(int i=0;i<n;i++)
    {
        fin>>x;
        int c = cautare(x, i);
        s[c] = x;
        p[i] = c;
        if(c>maxi)
            maxi = c;
    }
    fout<<maxi+1<<endl;
    for(int i=0;i<=maxi;i++)
        fout<<s[i]<<" ";
    return 0;
}