#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
const double pi=3.14159265358979323846;
const double eps=1e-9;
const int inf=1e9;
const long long INF=4e18;
const int mod=1e9+7;
using namespace std;
const int N=1e5+10;

void solve()
{
    int k;
    cin>>k;
    string s;
    cin>>s;
    int n,m;
    cin>>n>>m;
    int ans=m-n+1;
    ans%=k;
    for(int i=1;i<=m;i++){
    	int u,v;
    	cin>>u>>v;
    }
    if(s[ans]=='1')cout<<2<<endl;
    else cout<<1<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}