Problem: Nudist Beach is planning a military operation to attack the Life Fibers. In this operation, they will attack and capture several cities which are currently under the control of the Life Fibers.

There are n cities, labeled from 1 to n, and m bidirectional roads between them. Currently, there are Life Fibers in every city. In addition, there are k cities that are fortresses of the Life Fibers that cannot be captured under any circumstances. So, the Nudist Beach can capture an arbitrary non-empty subset of cities with no fortresses.

After the operation, Nudist Beach will have to defend the captured cities from counterattack. If they capture a city and it is connected to many Life Fiber controlled cities, it will be easily defeated. So, Nudist Beach would like to capture a set of cities such that for each captured city the ratio of Nudist Beach controlled neighbors among all neighbors of that city is as high as possible. 

More formally, they would like to capture a non-empty set of cities S with no fortresses of Life Fibers. The strength of a city <image> is defined as (number of neighbors of x in S) / (total number of neighbors of x). Here, two cities are called neighbors if they are connnected with a road. The goal is to maximize the strength of the weakest city in S.

Given a description of the graph, and the cities with fortresses, find a non-empty subset that maximizes the strength of the weakest city. 

Input

The first line of input contains three integers n, m, k (2 ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000, 1 ≤ k ≤ n - 1).

The second line of input contains k integers, representing the cities with fortresses. These cities will all be distinct. 

The next m lines contain the roads. The i-th of these lines will have 2 integers ai, bi (1 ≤ ai, bi ≤ n, ai ≠ bi). Every city will have at least one road adjacent to it.

There is no more than one road between each pair of the cities.

Output

The first line should contain an integer r, denoting the size of an optimum set (1 ≤ r ≤ n - k). 

The second line should contain r integers, denoting the cities in the set. Cities may follow in an arbitrary order. This line should not contain any of the cities with fortresses.

If there are multiple possible answers, print any of them.

Examples

Input

9 8 4
3 9 6 8
1 2
1 3
1 4
1 5
2 6
2 7
2 8
2 9


Output

3
1 4 5


Input

10 8 2
2 9
1 3
2 9
4 5
5 6
6 7
7 8
8 10
10 4


Output

8
1 5 4 8 10 6 3 7

Note

The first example case achieves a strength of 1/2. No other subset is strictly better.

The second example case achieves a strength of 1. Note that the subset doesn't necessarily have to be connected.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
  return ((a.first * 1LL * b.second - b.first * 1LL * a.second) < 0);
}
struct cmpiii {
  bool operator()(const pair<pair<int, int>, int> &a,
                  const pair<pair<int, int>, int> &b) const {
    if (a.first.first * 1LL * b.first.second ==
        b.first.first * a.first.second) {
      return (a.second < b.second);
    } else {
      return cmp(a.first, b.first);
    }
  }
};
const int nmax = 1e5 + 10;
vector<bool> fort;
vector<bool> mark;
vector<int> g[nmax];
vector<pair<int, int> > frac;
multiset<pair<pair<int, int>, int>, cmpiii> q;
vector<pair<pair<int, int>, int> > ans;
inline void dfs(const int u) {
  assert(mark[u] == false);
  mark[u] = true;
  int numer = 0;
  for (int i = 0; i < (int)g[u].size(); ++i) {
    int v = g[u][i];
    if (not fort[v]) numer++;
    if (not mark[v]) dfs(v);
  }
  frac[u] = make_pair(numer, (int)g[u].size());
}
void dfs_runner(const int n) {
  mark.assign(n, false);
  frac.assign(n, {0, 0});
  for (int i = 0; i < n; ++i) {
    if (not mark[i]) dfs(i);
  }
  for (int i = 0; i < n; ++i) assert(mark[i]);
}
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  fort.assign(n, false);
  for (int i = 0; i < k; ++i) {
    int x;
    scanf("%d", &x);
    x--;
    fort[x] = true;
  }
  for (int i = 0; i < m; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--, y--;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  dfs_runner(n);
  for (int i = 0; i < n; ++i) {
    if (not fort[i]) {
      q.insert(make_pair(frac[i], i));
    }
  }
  while (not q.empty()) {
    ans.push_back(*q.begin());
    int u = q.begin()->second;
    assert(q.begin()->first == frac[u]);
    assert(mark[u] == true);
    q.erase(q.begin());
    mark[u] = false;
    for (int i = 0; i < (int)g[u].size(); ++i) {
      int v = g[u][i];
      if (not fort[v] and mark[v]) {
        auto iii = *q.find(make_pair(frac[v], v));
        assert(iii.first == frac[v] and iii.second == v);
        q.erase(q.find(make_pair(frac[v], v)));
        frac[v].first--;
        q.insert(make_pair(frac[v], v));
      }
    }
  }
  int idx = 0;
  for (int i = 0; i < (int)ans.size(); ++i) {
    if (cmp(ans[idx].first, ans[i].first)) idx = i;
  }
  printf("%d\n", (int)ans.size() - idx);
  for (int i = idx; i < (int)ans.size(); ++i) {
    printf("%d ", ans[i].second + 1);
  }
  return 0;
}