using System;
using System.Linq;
using System.Collections.Generic;

namespace Contest
{
  class Program
  {
    static void Main(string[] args)
    {
      IntroductionToHeuristics.C();
    }
    class IntroductionToHeuristics
    {
      public static void A()
      {

      }
      public static void B()
      {
        var D = Read.Int();
        var C = Read.IntN();
        var S = Read.LongMatrix(D, 26);
        var T = Enumerable.Range(0, D).Select(i => Read.Int()).ToArray();
        var last = new int[26];
        long score = 0;
        var ans = new List<long>();
        for(int i = 0; i < D; ++i)
        {
          score += S[i, T[i] - 1];
          last[T[i] - 1] = i + 1;
          for(int j = 0; j < 26; ++j)
          {
            score -= C[j] * (i + 1 - last[j]);
          }
          ans.Add(score);
        }
        Console.WriteLine(String.Join(Environment.NewLine, ans));
      }
      public static void C()
      {
        var D = Read.Int();
        var C = Read.IntN();
        var S = Read.LongMatrix(D, 26);
        var T = Enumerable.Range(0, D).Select(i => Read.Int() - 1).ToArray();
        var M = Read.Int();
        var DQ = Read.TupleInt(M);
        var LastDays = Enumerable.Range(0, 26).Select(i => new Util.Set<int>()).ToArray();
        for(int i = 0; i < 26; ++i)
        {
          LastDays[i].Insert(-1);
          LastDays[i].Insert(D);
        }
        var last = Enumerable.Range(0, 26).Select(i => -1).ToArray();
        long score = 0;
        var ans = new List<long>();
        for (int i = 0; i < D; ++i)
        {
          score += S[i, T[i]];
          last[T[i]] = i;
          for (int j = 0; j < 26; ++j)
          {
            score -= C[j] * (i - last[j]);
          }
          LastDays[T[i]].Insert(i);
        }
        for(int i = 0; i < M; ++i)
        {
          var d = DQ[i].Item1 - 1;
          var q = DQ[i].Item2 - 1;
          var p = T[d];
          if (p == q) { ans.Add(score); continue; }
          T[d] = q;
          score += -S[d, p] + S[d, q];
          var prevQ = LastDays[q].ElementAt(LastDays[q].LowerBound(d) - 1);
          var nextQ = LastDays[q].ElementAt(LastDays[q].LowerBound(d));
          var prevP = LastDays[p].ElementAt(LastDays[p].LowerBound(d) - 1);
          var nextP = LastDays[p].ElementAt(LastDays[p].LowerBound(d + 1));
          score += C[q] * (d - prevQ) * (nextQ - d) - C[p] * (d - prevP) * (nextP - d);
          LastDays[q].Insert(d);
          LastDays[p].Remove(d);
          ans.Add(score);
        }
        Console.WriteLine(String.Join(Environment.NewLine, ans));
      }
    }

    class Util
    {
      public static T[,] Gen<T>(int r, int c, T v)
      {
        var matrix = new T[r, c];
        for (int i = 0; i < r; ++i)
        {
          for (int j = 0; j < c; ++j)
          {
            matrix[i, j] = v;
          }
        }
        return matrix;
      }
      public static long[] ASum(long[] array)
      {
        var res = new long[array.Length + 1];
        for (int i = 0; i < array.Length; ++i)
        {
          res[i + 1] = res[i] + array[i];
        }
        return res;
      }
      public static long[,] ASum(long[,] matrix)
      {
        var N = matrix.GetLength(0);
        var M = matrix.GetLength(1);
        var res = new long[N + 1, M + 1];
        for(int i = 0; i < N; ++i)
        {
          for(int j = 0; j < M; ++j)
          {
            res[i + 1, j + 1] = res[i, j + 1] + res[i + 1, j] - res[i, j] + matrix[i, j];
          }
        }
        return res;
      }
      public static Dictionary<T, long> Frequency<T>(T[] array)
      {
        var dict = new Dictionary<T, long>();
        foreach (var a in array)
        {
          if (!dict.ContainsKey(a)) { dict.Add(a, 0); }
          dict[a]++;
        }
        return dict;
      }

      public static long Power(long a, long n, long p)
      {
        long res = 1;
        long mult = a;
        for (int i = 0; i < 63; ++i)
        {
          if ((n & ((long)1 << i)) > 0)
          {
            res = (res * mult) % p;
          }
          mult = (mult * mult) % p;
        }
        return res;
      }
      public static long Inverse(long a, long p)
      {
        long b = p, c = 1, d = 0, e = 0, f = 0;
        while (b != 0)
        {
          e = a / b;
          f = b; b = a - e * b; a = f;
          f = d; d = c - e * d; c = f;
        }
        c %= p;
        return c + (c < 0 ? p : 0);
      }

      public static long[] Facts(int n, long p)
      {
        var facts = new long[n + 1];
        facts[0] = 1;
        for (int i = 1; i <= n; ++i)
        {
          facts[i] = (i * facts[i - 1]) % p;
        }
        return facts;
      }
      public static Func<int, int, long> Combin(int n, long P)
      {
        var fact = Facts(n, P);
        var inv = fact.Select(x => Inverse(x, P)).ToArray();
        return (N, M) =>
        {
          if (N < 0 || N < M || M < 0) { return 0; }
          return (((fact[N] * inv[M]) % P) * inv[N - M]) % P;
        };
      }
      public static Func<int, int, bool, long> Perm(int n, long P)
      {
        var fact = Facts(n, P);
        var inv = fact.Select(x => Inverse(x, P)).ToArray();
        return (N, M, isPerm) =>
        {
          if (N < 0 || N < M || M < 0) { return 0; }
          return isPerm ? (fact[N] * inv[N - M]) % P : (((fact[N] * inv[M]) % P) * inv[N - M]) % P;
        };
      }
      public class BST<T> where T : IComparable
      {
        public class Node
        {
          public T V;
          public Node L, R;
          public int Count;
          public Node(T v) { V = v; Count = 1; }
        }
        static Random _rnd = new Random();
        public static int Count(Node t) { return t == null ? 0 : t.Count; }
        static Node Update(Node t) { t.Count = Count(t.L) + Count(t.R) + 1; return t; }
        public static Node Merge(Node l, Node r)
        {
          if (l == null || r == null) return l == null ? r : l;
          if ((double)Count(l) / (double)(Count(l) + Count(r)) > _rnd.NextDouble())
          { l.R = Merge(l.R, r); return Update(l); }
          else { r.L = Merge(l, r.L); return Update(r); }
        }
        public static Tuple<Node, Node> Split(Node t, int k)
        {
          if (t == null) return new Tuple<Node, Node>(null, null);
          if (k <= Count(t.L))
          {
            var s = Split(t.L, k);
            t.L = s.Item2;
            return new Tuple<Node, Node>(s.Item1, Update(t));
          }
          else
          {
            var s = Split(t.R, k - Count(t.L) - 1);
            t.R = s.Item1;
            return new Tuple<Node, Node>(Update(t), s.Item2);
          }
        }
        public static Node Remove(Node t, T v)
        {
          if (Find(t, v) == null) return t;
          return RemoveAt(t, LowerBound(t, v));
        }
        public static Node RemoveAt(Node t, int k)
        {
          var s = Split(t, k);
          var s2 = Split(s.Item2, 1);
          return Merge(s.Item1, s2.Item2);
        }
        public static bool Contains(Node t, T v) { return Find(t, v) != null; }
        public static Node Find(Node t, T v)
        {
          while (t != null)
          {
            var cmp = t.V.CompareTo(v);
            if (cmp > 0) t = t.L;
            else if (cmp < 0) t = t.R;
            else break;
          }
          return t;
        }

        public static Node FindByIndex(Node t, int idx)
        {
          if (t == null) return null;
          var currentIdx = Count(t) - Count(t.R) - 1;
          while (t != null)
          {
            if (currentIdx == idx) return t;
            if (currentIdx > idx)
            { t = t.L; currentIdx -= (Count(t == null ? null : t.R) + 1); }
            else { t = t.R; currentIdx += (Count(t == null ? null : t.L) + 1); }
          }
          return null;
        }
        public static int UpperBound(Node t, T v)
        {
          var torg = t;
          if (t == null) return -1;

          var ret = Int32.MaxValue;
          var idx = Count(t) - Count(t.R) - 1;
          while (t != null)
          {
            var cmp = t.V.CompareTo(v);

            if (cmp > 0)
            {
              ret = Math.Min(ret, idx);
              t = t.L;
              idx -= (Count(t == null ? null : t.R) + 1);
            }
            else if (cmp <= 0)
            {
              t = t.R;
              idx += (Count(t == null ? null : t.L) + 1);
            }
          }
          return ret == Int32.MaxValue ? Count(torg) : ret;
        }
        public static int LowerBound(Node t, T v)
        {
          var torg = t;
          if (t == null) return -1;

          var idx = Count(t) - Count(t.R) - 1;
          var ret = Int32.MaxValue;
          while (t != null)
          {
            var cmp = t.V.CompareTo(v);
            if (cmp >= 0)
            {
              if (cmp == 0) ret = Math.Min(ret, idx);
              t = t.L;
              if (t == null) ret = Math.Min(ret, idx);
              idx -= t == null ? 0 : (Count(t.R) + 1);
            }
            else if (cmp < 0)
            {
              t = t.R;
              idx += (Count(t == null ? null : t.L) + 1);
              if (t == null) return idx;
            }
          }
          return ret == Int32.MaxValue ? Count(torg) : ret;
        }
        public static Node Insert(Node t, T v)
        {
          var ub = LowerBound(t, v);
          return InsertByIdx(t, ub, v);
        }
        static Node InsertByIdx(Node t, int k, T v)
        {
          var s = Split(t, k);
          return Merge(Merge(s.Item1, new Node(v)), s.Item2);
        }
        public static IEnumerable<T> Enumerate(Node t)
        {
          var ret = new List<T>();
          Enumerate(t, ret);
          return ret;
        }
        static void Enumerate(Node t, List<T> ret)
        {
          if (t == null) return;
          Enumerate(t.L, ret);
          ret.Add(t.V);
          Enumerate(t.R, ret);
        }
      }
      public class Set<T> where T : IComparable
      {
        protected BST<T>.Node _root;
        public T this[int idx] { get { return ElementAt(idx); } }
        public int Count() { return BST<T>.Count(_root); }
        public virtual void Insert(T v)
        {
          if (_root == null) _root = new BST<T>.Node(v);
          else
          {
            if (BST<T>.Find(_root, v) != null) return;
            _root = BST<T>.Insert(_root, v);
          }
        }
        public void Clear() { _root = null; }
        public void Remove(T v) { _root = BST<T>.Remove(_root, v); }
        public bool Contains(T v) { return BST<T>.Contains(_root, v); }
        public T ElementAt(int k)
        {
          var node = BST<T>.FindByIndex(_root, k);
          if (node == null) throw new IndexOutOfRangeException();
          return node.V;
        }
        public int Count(T v) { return BST<T>.UpperBound(_root, v) - BST<T>.LowerBound(_root, v); }
        public int LowerBound(T v) { return BST<T>.LowerBound(_root, v); }
        public int UpperBound(T v) { return BST<T>.UpperBound(_root, v); }
        public Tuple<int, int> EqualRange(T v)
        {
          if (!Contains(v)) return new Tuple<int, int>(-1, -1);
          return new Tuple<int, int>(BST<T>.LowerBound(_root, v), BST<T>.UpperBound(_root, v) - 1);
        }
        public List<T> ToList() { return new List<T>(BST<T>.Enumerate(_root)); }
      }
    }

    struct MOD
    {
      public static long P = 1000000007;
      public readonly long V;

      public MOD(long a) { this.V = a % P; }
      public static implicit operator MOD(long a) { return new MOD(a); }
      public static MOD operator +(MOD a, MOD b) { return new MOD((a.V + b.V) % P); }
      public static MOD operator -(MOD a, MOD b) { return new MOD((a.V - b.V + P) % P); }
      public static MOD operator *(MOD a, MOD b) { return new MOD((a.V * b.V) % P); }
      public static MOD operator /(MOD a, MOD b) { return new MOD((a.V * b.Inverse().V) % P); }
      public MOD Inverse()
      {
        long a = V, p = P; long b = p, c = 1, d = 0, e = 0, f = 0;
        while (b != 0) { e = a / b; f = b; b = a - e * b; a = f; f = d; d = c - e * d; c = f; }
        c %= p;
        return c + (c < 0 ? p : 0);
      }
      public MOD Power(long n)
      {
        long a = V, p = P; long res = 1; long mult = a;
        for (int i = 0; i < 63; ++i) { if ((n & ((long)1 << i)) > 0) { res = (res * mult) % p; } mult = (mult * mult) % p; }
        return res;
      }
      public override string ToString() { return V.ToString(); }
    }

    static class Read
{
static Queue<string> queue = new Queue<string>();
static void Enqueue() { var ss = Console.ReadLine().Split(' '); foreach (var s in ss) { queue.Enqueue(s); } }
public static int Int() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt32(queue.Dequeue()); }
public static long Long() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt64(queue.Dequeue()); }
public static string Str() { if (queue.Count == 0) { Enqueue(); } return queue.Dequeue(); }
public static int[] IntN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt32(s)).ToArray(); }
public static long[] LongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt64(s)).ToArray(); }
public static ulong[] ULongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToUInt64(s)).ToArray(); }
public static string[] StrN() { return Console.ReadLine().Split(' '); }
public static Tuple<int, int>[] TupleInt(int n) { List<Tuple<int, int>> list = new List<Tuple<int, int>>(); for (int i = 0; i < n; ++i) { var ab = Read.IntN(); list.Add(new Tuple<int, int>(ab[0], ab[1])); } return list.ToArray(); }
public static Tuple<long, long>[] TupleLong(int n) { List<Tuple<long, long>> list = new List<Tuple<long, long>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<long, long>(ab[0], ab[1])); } return list.ToArray(); }
public static Tuple<string, string>[] TupleStr(int n) { List<Tuple<string, string>> list = new List<Tuple<string, string>>(); for (int i = 0; i < n; ++i) { var ab = Read.StrN(); list.Add(new Tuple<string, string>(ab[0], ab[1])); } return list.ToArray(); }
public static Tuple<double, double>[] TupleDouble(int n) { List<Tuple<double, double>> list = new List<Tuple<double, double>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<double, double>(ab[0], ab[1])); } return list.ToArray(); }
public static long[,] LongMatrix(int r, int c) { var mat = new long[r, c]; for (int i = 0; i < r; ++i) { var x = Read.LongN(); for (int j = 0; j < c; ++j) { mat[i, j] = x[j]; } } return mat; }
public static Dictionary<int, HashSet<int>> AdjacencyList(int N, int M, bool isDirectional = false)
{
Dictionary<int, HashSet<int>> dict = new Dictionary<int, HashSet<int>>();
for (int i = 0; i <= N; ++i) { dict.Add(i, new HashSet<int>()); }
        for (int i = 0; i < M; ++i) { var ab = Read.IntN(); if (!dict[ab[0]].Contains(ab[1])) { dict[ab[0]].Add(ab[1]); } if (!isDirectional && !dict[ab[1]].Contains(ab[0])) { dict[ab[1]].Add(ab[0]); } }
        return dict;
}
public static Dictionary<int, Dictionary<int, long>> AdjacencyListWithWeight(int N, int M)
{
Dictionary<int, Dictionary<int, long>> dict = new Dictionary<int, Dictionary<int, long>>(); for (int i = 0; i <= N; ++i) { dict.Add(i, new Dictionary<int, long>()); }
for (int i = 0; i < M; ++i) { var ab = Read.IntN(); dict[ab[0]].Add(ab[1], ab[2]); dict[ab[1]].Add(ab[0], ab[2]); }
return dict;
}
}
    }
}


Measured memory_bytes: 35084