#include <bits/stdc++.h>
#include <stdio.h>

#define __Shibae__      signed main()
#define IOS             ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fiopen(Path)    freopen(Path".INP", "r", stdin); freopen(Path".OUT", "w", stdout);
#define fipen(Path)     freopen(Path".INP", "r", stdin);
#define sz(s)           (int)s.size()
#define all(x)          x.begin(), x.end()
#define maxHeap         priority_queue<int>
#define minHeap         priority_queue<int, vector<int>, greater<int>>
#define getBit(x, k)    (((x) >> (k)) & 1)
#define MASK(i)         (1LL << (i))
#define SQR(x)          (1LL * ((x) * (x)))
#define db              double
#define ld              long double
#define ui              unsigned int
#define ll              long long
#define ii              pair<int, int>
#define pli             pair<ll, int>
#define pil             pair<int, ll>
#define pll             pair<ll, ll>
#define fi              first
#define se              second

#define FOR(i, a, b)    for(int i = a, _b = b; i <= _b; i += 1)
#define FOD(i, a, b)    for(int i = a, _b = b; i >= _b; i -= 1)
#define REP(i, a)       for(int i = 0, _a = a; i < _a; i++)
#define pb              push_back
#define fau(u, a)       for(auto &u : a)
#define debug           return cout << "debug", void();

using namespace std;

const ll mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);
const int MAX = 5e5+5;
 
const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

ll Rand(ll l, ll r) 
{
    return uniform_int_distribution<ll>(l, r)(rd);
}

template<class SHIBA, class ENGINE>
    bool minimize(SHIBA &x, const ENGINE y)
    {
        if(x > y)
        {
            x = y;
            return true;
        } 
        else return false;
    }
template<class SHIBA, class ENGINE>
    bool maximize(SHIBA &x, const ENGINE y)
    {
        if(x < y)
        {
            x = y;
            return true;
        }
        else return false;
    }


/* Template by: Nguyen Nhat Anh from Luong Van Chanh High School for the gifted */
/* From Min Tuoi with love */
        /**       TRY HARD        **/
        /**          ORZ          **/

/* -----------------[ MAIN CODE ]----------------- */

int n, m, q, T;
int a[MAX];
int st[MAX << 1];           
vector<int> dep[MAX << 1];  
int required[MAX];
int res;

int jett(int l, int r, int i)
{
    int cnt = 0;
    for (l = l - 1 + n, r = r + n; l < r; l >>= 1, r >>= 1) 
    {
        if (l & 1) {
            dep[l].pb(i);
            cnt++;
            l++;
        }
        if (r & 1) {
            r--;
            dep[r].pb(i);
            cnt++;
        }
    }
    return cnt;
}

void input()
{
    cin >> n >> m >> q >> T;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, m)
    {
        int l, r; cin >> l >> r;
        required[i] = jett(l, r, i);
    }
}

void modify(int i)
{
    required[i]--;
    if (!required[i]) res++;
}

void build()
{
    for (int i = 0; i < n; i++) 
    {
        st[n + i] = a[i + 1];
    }
    
    for (int i = n - 1; i > 0; i--) 
    {
        st[i] = st[i << 1] + st[i << 1 | 1];
    }
    
    for (int i = 1; i < 2 * n; i++) 
    {
        if (!st[i]) fau(x, dep[i]) modify(x);
    }
}

void update(int i)
{
    for (int id = i - 1 + n; id > 0; id >>= 1) 
    {
        st[id]--;
        if (!st[id]) fau(x, dep[id]) modify(x);
    }
}

void solve()
{
    build();
    while(q--)
    {
        int y; cin >> y;
        int x;
        if (!T) x = y;
        else x = ((res + y) % n) + 1;

        update(x);

        cout << res << "\n";
    }
}

__Shibae__
{
    IOS
    // fiopen("sanlap")

    const bool multitest = 0;
    int tt = 1; if(multitest) cin >> tt;
 
    while( tt-- ){
        input();
        solve();
        if(tt) cout << "\n";
    }
 
    return 0;
}