#![allow(dead_code, unused_mut)]
#![allow(non_snake_case)]

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut 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, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    input!{
        n: usize, m: usize, q: usize,
        l: [String; n],
        e: [(usize, usize); m],
        que: [(usize, usize, usize); q]
    }
    let mut uf = UnionFind::new(n*7);
    let mut G = vec![Vec::new(); n];
    let mut c = vec![0; n];
    for i in 0..n {
        for x in l[i].chars().rev().map(|x| x.to_digit(10).unwrap() ) {
            c[i] <<= 1;
            c[i] |= x;
        }
        for j in 0..7 {
            if (c[i] >> j) & (c[i] >> ((j+1) % 7)) & 1 > 0 {
                uf.unite(i * 7 + j, i * 7 + (j+1) % 7).ok();
            }
        }
    }
    for &(u, v) in &e {
        let u = u - 1;
        let v = v - 1;
        G[u].push(v);
        G[v].push(u);
        let b = c[u] & c[v];
        for i in 0..7 {
            if b >> i & 1 > 0 {
                uf.unite(u * 7 + i, v * 7 + i).ok();
            }
        }
    }
    for &(t, x, y) in &que {
        if t == 1 {
            let x = x - 1;
            let y = y - 1;
            c[x] |= 1 << y;
            for j in [(y + 1) % 7, (y + 6) % 7].iter() {
                if c[x] >> j & c[x] >> y & 1 > 0 {
                    uf.unite(x * 7 + y, x * 7 + j).ok();
                }
            }
            for &v in &G[x] {
                if (c[x] & c[v]) >> y & 1 > 0 {
                    uf.unite(x * 7 + y, v * 7 + y).ok();
                }
            }
        } else {
            println!("{}", uf.size((x - 1) * 7));
        }
    }
}

#[derive(Clone, Copy, Debug)]
enum PatentOrSize {
    Parent(usize),
    Size(usize),
}

#[derive(Clone, Debug)]
pub struct UnionFind(Vec<PatentOrSize>);

impl UnionFind {
    pub fn new(len: usize) -> Self {
        Self(vec![PatentOrSize::Size(1); len])
    }

    pub fn is_empty(&self) -> bool {
        self.0.is_empty()
    }

    pub fn len(&self) -> usize {
        self.0.len()
    }

    pub fn find(&mut self, i: usize) -> usize {
        self._climb(i).0
    }

    pub fn size(&mut self, i: usize) -> usize {
        self._climb(i).1
    }

    pub fn unite(&mut self, u: usize, v: usize) -> Result<(), ()> {
        let (mut u, su) = self._climb(u);
        let (mut v, sv) = self._climb(v);
        if u == v { return Err(()); }
        if su < sv {
            std::mem::swap(&mut u, &mut v);
        }
        self.0[u] = PatentOrSize::Size(su + sv);
        self.0[v] = PatentOrSize::Parent(u);
        Ok(())
    }

    pub fn same(&mut self, u: usize, v:usize) -> bool {
        self.find(u) == self.find(v)
    }

    fn _climb(&mut self, i: usize) -> (usize, usize) {
        assert!(i < self.len());
        match self.0[i] {
            PatentOrSize::Parent(p) => {
                let ret = self._climb(p);
                self.0[i] = PatentOrSize::Parent(ret.0);
                ret
            }
            PatentOrSize::Size(s) => (i, s)
        }
    }
}