#include <iostream>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, l, r;
    cin >> n >> l >> r;
    
    set<int> seen;
    vector<int> a(n);
    
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        seen.insert(a[i]);
    }
    
    vector<int> result;
    
    for (int num = l; num <= r; ++num) {
        if (seen.find(num) == seen.end()) {
            result.push_back(num);
        }
    }
    
    // Sort result vector
    sort(result.begin(), result.end());
    
    // Print the result
    for (int i = 0; i < result.size(); ++i) {
        cout << result[i] << " ";
    }
    cout << endl;
    
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n,l,r;
int main(){
  cin >> n >> l >> r;
  bool check[r - l + 1] = {false};
  for (int i = 0; i < n; ++i)
  {
    int a;
    cin >> a;
    if (a >= l and a <= r)
    {
      check[a - l] = true;
    }
  }
  for (int i = 0; i <= r - l; ++i)
  {
    if (!check[i]) cout << l + i << " ";
  }
}