#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(|| {
            let stdin = io::stdin();
            let stdout = io::stdout();
            run(KInput::new(stdin.lock()), io::BufWriter::new(stdout.lock()))
        })?
        .join()
        .unwrap();
    Ok(())
}

fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }

    const D: usize = 365;
    assert_eq!(kin.input::<usize>(), D);
    let c: Vec<i32> = kin.seq(C);
    let mut s = vec![[0i32; C]; D];
    for i in 0..D {
        for j in 0..C {
            s[i][j] = kin.input();
        }
    }

    let mut sol: Vec<usize> = kin.seq(D);
    let mut tab = vec![Vec::new(); C];
    let mut score = 0;
    let mut last = [0; C];
    for d in 1..=D {
        tab[sol[d - 1] - 1].push(d);
        score += s[d - 1][sol[d - 1] - 1];
        last[sol[d - 1] - 1] = d;
        for i in 0..C {
            score -= c[i] * (d - last[i]) as i32;
        }
    }

    let m: usize = kin.input();
    for (d, q) in kin.iter::<(usize, usize)>().take(m) {
        let diff = |p, d_prev, d, d_next| {
            let x = (d - d_prev - 1) as i32;
            let y = (d_next - d - 1) as i32;
            let z = (d_next - d_prev - 1) as i32;
            c[p - 1] * ((z * (z + 1) - x * (x + 1) - y * (y + 1)) / 2)
        };

        let p = sol[d - 1];
        score += s[d - 1][q - 1] - s[d - 1][p - 1];
        sol[d - 1] = q;

        let i = tab[p - 1].iter().position(|&x| d == x).unwrap();
        let d_prev = *tab[p - 1].get(i.wrapping_sub(1)).unwrap_or(&0);
        let d_next = *tab[p - 1].get(i + 1).unwrap_or(&(D + 1));
        score -= diff(p, d_prev, d, d_next);
        tab[p - 1].remove(i);

        let i = tab[q - 1]
            .iter()
            .position(|&x| d <= x)
            .unwrap_or(tab[q - 1].len());
        let d_prev = *tab[q - 1].get(i.wrapping_sub(1)).unwrap_or(&0);
        let d_next = *tab[q - 1].get(i).unwrap_or(&(D + 1));
        score += diff(q, d_prev, d, d_next);
        tab[q - 1].insert(i, d);

        outputln!("{}", score);
    }
}

const C: usize = 26;

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
        pub fn src(&mut self) -> &mut R {
            &mut self.src
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.str().as_bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().expect("parse error")
                }
            })*
        }
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}


Measured memory_bytes: 2312