//---------- begin union_find ----------
pub struct DSU {
    p: Vec<i32>,
}
impl DSU {
    pub fn new(n: usize) -> DSU {
        DSU { p: vec![-1; n] }
    }
    pub fn init(&mut self) {
        for p in self.p.iter_mut() {
            *p = -1;
        }
    }
    pub fn root(&self, mut x: usize) -> usize {
        assert!(x < self.p.len());
        while self.p[x] >= 0 {
            x = self.p[x] as usize;
        }
        x
    }
    pub fn same(&self, x: usize, y: usize) -> bool {
        assert!(x < self.p.len());
        assert!(y < self.p.len());
        self.root(x) == self.root(y)
    }
    pub fn unite(&mut self, x: usize, y: usize) -> Option<(usize, usize)> {
        assert!(x < self.p.len());
        assert!(y < self.p.len());
        let mut x = self.root(x);
        let mut y = self.root(y);
        if x == y {
            return None;
        }
        if self.p[x] > self.p[y] {
            std::mem::swap(&mut x, &mut y);
        }
        self.p[x] += self.p[y];
        self.p[y] = x as i32;
        Some((x, y))
    }
    pub fn parent(&self, x: usize) -> Option<usize> {
        assert!(x < self.p.len());
        let p = self.p[x];
        if p >= 0 {
            Some(p as usize)
        } else {
            None
        }
    }
    pub fn size(&self, x: usize) -> usize {
        assert!(x < self.p.len());
        let r = self.root(x);
        (-self.p[r]) as usize
    }
}
//---------- end union_find ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::io::Write;

fn run() {
    input! {
        n: usize,
        m: usize,
        q: usize,
        s: [bytes; n],
        e: [(usize1, usize1); m],
        ask: [(u8, usize1, usize); q],
    }
    let mut s = s.into_iter().map(|s| {
        s.iter().rev().fold(0, |s, a| (s << 1) | ((*a == b'1') as usize))
    }).collect::<Vec<_>>();
    let f = 7;
    let mut g = vec![vec![]; n];
    let mut dsu = DSU::new(f * n);
    for (v, s) in s.iter().enumerate() {
        for i in 0..f {
            let j = (i + 1) % 7;
            if (*s >> i) & (*s >> j) & 1 == 1 {
                dsu.unite(i * n + v, j * n + v);
            }
        }
    }
    for (a, b) in e {
        g[a].push(b);
        g[b].push(a);
        for i in 0..f {
            if (s[a] & s[b]) >> i & 1 == 1 {
                dsu.unite(i * n + a, i * n + b);
            }
        }
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for (op, x, y) in ask {
        if op == 1 {
            let y = y - 1;
            s[x] |= 1 << y;
            for &u in g[x].iter() {
                if s[u] >> y & 1 == 1 {
                    dsu.unite(y * n + x, y * n + u);
                }
            }
            for i in [(y + 1) % 7, (y + 6) % 7].iter() {
                if s[x] >> i & 1 == 1 {
                    dsu.unite(i * n + x, y * n + x);
                }
            }
        } else {
            let ans = dsu.size(x);
            writeln!(out, "{}", ans).ok();
        }
    }
}

fn main() {
    run();
}