#include<bits/stdc++.h>
using namespace std;

int n, m, k;
vector<vector<int>> g;
vector<int> pos, dis, rem, ans;
void solve(){
    cin >> n >> m >> k;
    g.resize(n+1), pos.resize(k), dis.resize(k), rem.resize(n+1, -1);
    while(m--){
        int a, b; cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    queue<int> q;
    for(int i=0; i<k; ++i)
        cin >> pos[i] >> dis[i], 
        rem[pos[i]] = dis[i],
        q.push(pos[i]);
    
    while(!q.empty()){
        auto cur = q.front(); q.pop();
        if(rem[cur] == 0) continue;
        for(auto v: g[cur]){
            if(rem[v] < rem[cur] - 1)
                rem[v] = rem[cur] - 1,
                q.push(v);
        }
    }
    for(int i=1; i<=n; ++i)
        if(rem[i] != -1)
            ans.push_back(i);
    
    cout << (int)(ans.size()) << '\n';
    for(auto x: ans) cout << x << ' ';
}
signed main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    solve();
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define nl '\n'
#define all(v) v.begin(), v.end()
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const ll MOD = 1000000007;
int n, x, dp[1000001][101];
vector<int> c;
int rec(int x, int r){
	if(x == 0) return 1;
	if(x < 0 || r < 0) return 0;
	if(dp[x][r]!=-1) return dp[x][r];
	int ans = 0;
	ans += rec(x-c[r], r) + rec(x, r-1), ans%=MOD;
	return dp[x][r]=ans;
}
void solve(){
	cin >> n >> x; c.resize(n);
	for(int i=0; i<=x; ++i) for(int j=0; j<n; ++j) dp[i][j]=-1;
	for(int i=0; i<n; ++i) cin >> c[i];
	cout << rec(x, n-1);
}
signed main(){
	IOS
	solve();
}