#include <bits/stdc++.h>
using namespace std;
vector<long long> a, b;
vector<pair<long long, long long> > P;
long long ans[2000005];
priority_queue<long long> A, B;
map<long long, stack<int> > pos;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long aux;
  pair<long long, long long> pa;
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> aux;
    a.push_back(aux);
    A.push(aux);
  }
  for (int i = 0; i < m; i++) {
    cin >> aux;
    b.push_back(aux);
    B.push(aux * -1);
  }
  for (int i = 0; i < m; i++) {
    pos[b[i]].push(i);
    P.push_back(make_pair(A.top(), B.top() * -1));
    A.pop();
    B.pop();
  }
  for (int i = 0; i < m; i++) {
    pa = P[i];
    int ind = pos[pa.second].top();
    ans[ind] = pa.first;
    pos[pa.second].pop();
  }
  for (int i = 0; i < m; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}

### Prompt

Create a solution in cpp for the following problem:

Leha like all kinds of strange things. Recently he liked the function F(n, k). Consider all possible k-element subsets of the set [1, 2, ..., n]. For subset find minimal element in it. F(n, k) — mathematical expectation of the minimal element among all k-element subsets.

But only function does not interest him. He wants to do interesting things with it. Mom brought him two arrays A and B, each consists of m integers. For all i, j such that 1 ≤ i, j ≤ m the condition Ai ≥ Bj holds. Help Leha rearrange the numbers in the array A so that the sum <image> is maximally possible, where A' is already rearranged array.

Input

First line of input data contains single integer m (1 ≤ m ≤ 2·105) — length of arrays A and B.

Next line contains m integers a1, a2, ..., am (1 ≤ ai ≤ 109) — array A.

Next line contains m integers b1, b2, ..., bm (1 ≤ bi ≤ 109) — array B.

Output

Output m integers a'1, a'2, ..., a'm — array A' which is permutation of the array A.

Examples

Input

5
7 3 5 3 4
2 1 3 2 3


Output

4 7 3 5 3


Input

7
4 6 5 8 8 2 6
2 1 2 2 1 1 2


Output

2 6 4 5 8 8 6

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
vector<long long> a, b;
vector<pair<long long, long long> > P;
long long ans[2000005];
priority_queue<long long> A, B;
map<long long, stack<int> > pos;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long aux;
  pair<long long, long long> pa;
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> aux;
    a.push_back(aux);
    A.push(aux);
  }
  for (int i = 0; i < m; i++) {
    cin >> aux;
    b.push_back(aux);
    B.push(aux * -1);
  }
  for (int i = 0; i < m; i++) {
    pos[b[i]].push(i);
    P.push_back(make_pair(A.top(), B.top() * -1));
    A.pop();
    B.pop();
  }
  for (int i = 0; i < m; i++) {
    pa = P[i];
    int ind = pos[pa.second].top();
    ans[ind] = pa.first;
    pos[pa.second].pop();
  }
  for (int i = 0; i < m; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}

```