#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <fstream>
#include <string>
#include <set>
#include <deque>
#include <queue>
#include <map>
#include <bitset>
#include <random>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <cstdlib>
using namespace std;
#define all(a)            a.begin(), a.end()
typedef long long ll;
int main() {
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    srand(time(nullptr));
    ll n, m;
    cin >> n >> m;
    vector<ll> a(m);
    for (ll i = 0; i < m; i++) {
        cin >> a[i];
        a[i]--;
    }
    deque<ll> b;
    for (ll i = 0; i < n; i++) {
        ll k;
        cin >> k;
        k--;
        b.push_back(k);
    }
    vector<ll> prev;
    vector<bool> used(n, false);
    for (ll i = 0; i < m; i++) {
        if (!used[a[i]]) {
            while (1) {
                ll q = b.front();
                used[q] = true;
                prev.push_back(q);
                b.pop_front();
                if (q == a[i])break;
            }
        }
        else {
            prev.push_back(a[i]);
        }
    }
    map<ll, vector<ll>> pos;
    for (ll i = 0; i < (ll)prev.size(); i++) {
        pos[prev[i]].push_back(i);
    }
    struct query {
        ll l, r;
    };
    const ll c = 670;
    vector<query> block[c + 1];
    vector<ll> res((ll)prev.size(), -1);
    for (auto& i : pos) {
        for (ll j = 1; j < (ll)i.second.size(); j++) {
           // cout << i.second[j - 1] << ' ' << i.second[j] << endl;
            block[i.second[j - 1] / c].push_back({ i.second[j - 1],i.second[j] });
        }
        res[i.second.back()] = n;
    }
    auto cmp = [&](query &a, query &b) {
            return a.r < b.r;
    };
    vector<ll> cnt(n,0);
    ll ans = 0;
    auto del =[&](ll ind) {
        if (--cnt[prev[ind]] == 0)ans--;
    };
    auto plus =[&](ll ind) {
        if (cnt[prev[ind]]++ == 0)ans++;
    };
    res[prev.size() - 1] = n;
    for (ll i = 0; i <= c; i++) {
        sort(all(block[i]), cmp);
    }
    for (ll i = 0; i <= c; i++) {
        ll l = i * c, r = i * c - 1;
        ans = 0;
        cnt.assign(n + 1, 0);
        for (query &j : block[i]) {
            while (r < j.r)
                plus(++r);
            while (l < j.l)
                del(l++);
            while (l > j.l)
                plus(--l);

            if(res[j.l]==-1)
                res[j.l] = ans;
        }
    }
    cout << (ll)res.size() << endl;
    for (auto now : res) {
        cout << now << ' ';
    }
}