Go: package main

import "fmt"
import "strconv"

func main() {
  for i := 1; i <= 9; i++ {
    for j := 1; j <= 9; j++ {
      res := i * j
      fmt.Println(strconv.Itoa(i) + "x" + strconv.Itoa(j) + "=" + strconv.Itoa(res))
    }
  }
}

C++: #include<iostream>
using namespace std;

int main(){
	int i,j;
	for ( i = 1; i <= 9; i++ ) {
		for ( j = 1; j <= 9; j++ ) {
			printf("%dx%d=%d\n",i,j,i*j);
		}
	}


    return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
	for (int i=1;i<=9;i++)
	{
		cout<<i<<'x'<<i<<'='<<i*i;
		if (i!=9)cout<<endl;
	}
    return 0;
}

C++: #include<stdio.h>
using namespace std;

int main()
{
	for (int i = 1; i <= 9; i++)
	{
		for (int j = 1; j <= 9; j++)
		{
			printf("%d*%d=%d\n",i,j,i*j);
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
    for (int i = 0; i < 9; ++i)
    {
        for (int j = 0; j < 9; ++j)
        {
            cout << i+1 << "x" << j+1 << "=" << (i+1)*(j+1) << endl;
        }
    }

    return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
	for (int i=1; i<=9; i++){
		for (int j=1; j<=9; j++)
			cout << i << 'x' << j << '=' << i*j << '\n';
	}
	return 0;

}

C++: #include <iostream>

int main()
{
    for (int i = 1; i <= 9; ++i) {
        for (int j = 1; j <= 9; ++j) {
            std::cout << i << "x" << j << "=" << i * j << std::endl;
        }
    }
}

C++: - submit, private

C++: using System;

class Program
{
  static void Main()
  { 
    int i, j;
    for (i = 1; i < 10; i++){
      for (j = 1; j < 10; j++){
        Console.WriteLine(i+"x"+j+"="+i*j);  
      }
    }
  }
}

C++: #include<stdio.h>

int main(){
	for(int i=1;i<=9;i++)
	{
		for(int j=1;j<=9;j++)
		{
			printf("%dx%d=&d\n",i,j,i*j);
		}	
	}
    return 0;
}

C++: #include <iostream>

int main(int argc, const char * argv[])
{
    int result;
    
    for(int i = 1; i <= 9; i++){
        for(int j = 1; j <= 9; j++){
            result = i * j;
            std::cout << i << "×" << j << "=" << result << "\n";
        }
    }
    return 0;
}

C++: #include <iostream>

int main() {
	for ( int x = 1; x < 9+1; x++ ) {
		for ( int y = 1; y < 9+1; y++ ) {
			std::cout << x << "x" << y << "=" << x*y << std::endl;
		}
	}
}

C++: #include<iostream>
using namespace std;

int main(){
    for(int i=1;i<10;i++){
    for (int j = 1; j < 10; j++)
    {
        cout << i<<"x"<<j<<"="<<i*j<<endl;
    }
    
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

typedef long int lint;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<long, long> pll;

#define EACH(t, c) for (auto&& t : c)
#define ALL(c) begin(c), end(c)
#define FOR(i, s, e) for (int i = (s); i < (int)(e); ++i)
#define REP(i, n) FOR(i, 0, n)
#define endl '\n'
#define fk first
#define sv second

const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int MOD = (int)1e9 + 7;
const int INF = 999999999;

template<typename T>
void print(const std::vector<T>& v, char sep=' ') {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i != 0) cout << sep;
    cout << v[i];
  }
  cout << endl;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  REP(i, 9) {
    REP(j, 9) {
      cout << (i + 1) << "x" << (j + 1) << "=" << (i + 1) * (j + 1) << endl;
    }
  }
}

C++: #include<iostream>
using namespace std;

int main(){
  for(int i=1;i<=9;i++){
    for(int j=1;j<=9;j++){
      cout << i << "x" << j << "=" << i*j << endl;
    }
  }
  return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
using namespace std;

int main(){
   rep(i,1,10) rep(j,1,10) {
printf("%dx%d=%d\n",i,j,i*j);
}
    return 0;
}

C++: cin<<fhadsuifherfhdhgdasyerh<<out

C++: #include <cstdio>
int s,e;int main(){for(;e%=9,(s+=!e++)-10;)printf("%dx%d=%d\n",s,e,s*e);}

C++: #include <iostream>
int main() {
   for(int i=1;i<=9;i++) {
      for(int j=1;j<=9;j++) {
         std::cout << i << "x" << j << "=" << i*j << std::endl;
      }
   }
}

C++: #include<iostream>
using namespace std;

int main(){
	
	for(int first=1; first < 10; ++first)
	{
		for(int second=1; second < 10; ++second)
		{
			cout << first << "x" << second << "=" << first * second << endl;
		}
	}

    return 0;
}

C++: #include<stdio.h>

int main(){
  int i, j;
  for (i = 1; i < 10; i++){
    for (j = 1; j < 10; j++) printf("%dx%d=%d\n",i, j, i*j);
  }
  return 0;
}

C++: #include<cstdio>
using namespace std;
int main(){
  int i,j;
  for(i=1;i<=9;i++){
    for(j=1;j<=9;j++){
      printf("%dx%d=%d\n",i,j,i*j);
    }
  }
  return 0;
}

C++: 
#include<iostream>
using namespace std;

int main(){
int a = 1,b = 1,c;
while(a != 9 and b != 9){
c=a*b;
cout<<a<<"x"<<b<<"="<<c<<endl;
b++;
if(b == 10){
a++;
b = 1;
}

}
}

C++: 
#define r(i) for(i=1;i<10;i++)
main(i,j){
	r(i)
	r(j)
	std::cout<<i<<'x'<<j<<'='<<i*j<<std::endl;
	return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
	int i, j;

	for(i=1;i<10;i++){
		for(j=1;j<10;j++){
			cout<< i << "x" <<  j << "=" << i*j <<endl;
		}

	}


	return 0;
}

C++: #iinclude <iostream>
using namespace std;
int main()
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;i++)
{
cout << i << 'x' << j << '=' << i*j << endl;
}
}
return 0;
}

C++: #include <iostream>
using namespace std;

int main() {
  for(int i = 1; i <= 9; ++i) {
    for(int j = 1; j <= 9; ++j) {
      cout << i << "x" << j << "=" << i*j << endl;
    }
  }
  return 0;
}

C++: #include<cstdio>
#include<cstring>
#define MAXN 1000010
char a[2][MAXN];
inline int MIN(int x, int y) {
	return x > y ? y : x;
}
struct node {
	int left, right;
};
node tree[MAXN << 2];
inline void PushUp(int mid, int L, int R, int rt) {
	tree[rt].left = tree[rt << 1].left;
	tree[rt].right = tree[rt << 1 | 1].right;
	if (tree[rt].left == mid - L + 1)
		tree[rt].left += tree[rt << 1 | 1].left;
	if (tree[rt].right == R - mid)
		tree[rt].right += tree[rt << 1].right;
}
void Build(int L, int R, int rt) {
	if (L == R) {
		if (a[0][L] == a[1][L])
			tree[rt].left = tree[rt].right = 1;
		else
			tree[rt].left = tree[rt].right = 0;
	} else {
		int mid = (L + R) >> 1;
		Build(L, mid, rt << 1);
		Build(mid + 1, R, rt << 1 | 1);
		PushUp(mid, L, R, rt);
	}
}
void Update(int x, int L, int R, int rt) {
	if (L == R) {
		if (a[0][L] == a[1][L])
			tree[rt].left = tree[rt].right = 1;
		else
			tree[rt].left = tree[rt].right = 0;
	} else {
		int mid = (L + R) >> 1;
		Build(L, mid, rt << 1);
		Build(mid + 1, R, rt << 1 | 1);
		PushUp(mid, L, R, rt);
	}
}
int Query(int x, int L, int R, int rt) {
	if (R - tree[rt].right + 1 <= x)
		return (R - tree[rt].right + 1) + tree[rt].left;
	else {
		int mid = (L + R) >> 1;
		if (x <= mid)
			return Query(x, L, mid, rt << 1);
		else
			return Query(x, mid + 1, R, rt << 1 | 1);
	}
}
int main() {
	int ca = 1;
	int ans;
	int c, la, lb, n, q;
	int cmd, id, i;
	char ch;
	scanf("%d", &c);
	while (c--) {
		scanf(" %s %s", a[0], a[1]);
		la = strlen(a[0]);
		lb = strlen(a[1]);
		n = MIN(la, lb) - 1;
		Build(0, n, 1);
		scanf("%d", &q);
		printf("Case %d:\n", ca++);
		while (q--) {
			scanf("%d", &cmd);
			if (cmd == 1) {
				scanf("%d%d %c", &id, &i, &ch);
				a[id][i] = ch;
				Update(i, 0, n, 1);
			} else {
				scanf("%d", &i);
				if (a[0][i] == a[1][i])
					ans = Query(i, 0, n, 1);
				printf("%d\n", ans);
			}
		}
	}
	return 0;
}
/*
Case 1:
2
2
2
4
2

4

*/

C++: #include <stdio.h>
int main(void)
{
	for (int i = 1; i <= 9; i++) {
		for (int j = 1; j <= 9; j++) {
			printf("%dx%d=%d\n", i, j, i*j);
		}
	}
	return 0;
}

C++:  #include <bits/stdc++.h>
#ifdef dbg
#include "./printer.hpp"
#else
#define dump(x) void(0)
#endif

using namespace std;
#define ll long long
inline long  toInt(string s) {long  v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
#define INF 100000
int main(){
  ios_base::sync_with_stdio(0);

  for(ll i = 1; i < 10; i++){
    printf("%dx%d=%d\n",i,i,i*i);
  }

  return 0;

}