#include<bits/stdc++.h>
#define AC return 0;
#define int long long 
#define pii pair<int,int>
#define all(tar) tar.begian(),tar.end()
const int maxx=2e5+5;
const int mod=998244353; 
using namespace std;

void Solve()
{
    int k;
    cin >> k;
    string s;
    cin >> s;
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        cin >> u >> v;
    }
    int t = (m - n + 1) % k;
    cout << (s[t] == '1' ? "2\n" : "1\n");
    return ;
}
signed main(){
   ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   
   int T;
   cin >> T;
   while (T--)
   {
    Solve();
   }
   
   AC
}