public void Solve(MyInputStream cin)
{
var N = cin.ReadInt();
var D = cin.ReadInt();
var K = cin.ReadInt();
int[] L, R, S, T;
cin.ReadIntArrays(D, out L, out R);
cin.ReadIntArrays(K, out S, out T);
for (int i = 0; i < K; ++i)
{
int pos = S[i];
int j;
for (j = 0; j < D; ++j)
{
if (L[j] <= pos && pos <= R[j] && L[j] <= T[i] && T[i] <= R[j])
{
break;
}
else if (L[j] <= pos && pos <= R[j])
{
if (T[i] < pos)
{
pos = L[j];
}
else
{
pos = R[j];
}
}
}
WriteLine(j + 1);
}
}
public void Solve()
{
var cin = new MyInputStream();
var h = cin.ReadInt();
var w = cin.ReadInt();
var hx = (h - 2 + 1) * w;
var wx = (w - 2 + 1) * h;
Console.WriteLine(hx + wx);
}
public void Solve(MyInputStream cin)
{
var R = cin.ReadInt();
var C = cin.ReadInt();
var K = cin.ReadInt();
var N = cin.ReadInt();
var r = new int[R];
var c = new int[C];
var candy = new List <Pair <int> >();
for (int i = 0; i < N; i++)
{
var y = cin.ReadInt() - 1;
var x = cin.ReadInt() - 1;
r[y]++;
c[x]++;
candy.Add(new Pair <int>(x, y));
}
var _r = new int[N + 1];
var _c = new int[N + 1];
foreach (var i in r)
{
_r[i]++;
}
foreach (var i in c)
{
_c[i]++;
}
var ret = 0L;
for (int i = 0; i <= K; i++)
{
ret += (long)_r[i] * (long)_c[K - i];
}
for (int i = 0; i < N; ++i)
{
var x = candy[i].First;
var y = candy[i].Second;
if (c[x] + r[y] == K)
{
ret--;
}
if (c[x] + r[y] == K + 1)
{
ret++;
}
}
WriteLine(ret);
}
public void Solve()
{
MyInputStream cin = new MyInputStream();
var N = cin.ReadInt();
if (N == 1)
{
WriteLine("1 1");
}
else
{
var dp = new long[N + 2];
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= N + 1; i++)
{
dp[i] = dp[i - 1] + dp[i - 2];
}
WriteLine($"{dp[N - 1]} {dp[N]}");
}
}
public void Solve(MyInputStream cin)
{
const int MOD = 1000000007;
var N = cin.ReadInt();
var a = cin.ReadInt() - 1;
var b = cin.ReadInt() - 1;
var M = cin.ReadInt();
var g = new List <int> [N];
for (int i = 0; i < N; i++)
{
g[i] = new List <int>();
}
for (int i = 0; i < M; i++)
{
var x = cin.ReadInt() - 1;
var y = cin.ReadInt() - 1;
g[x].Add(y);
g[y].Add(x);
}
var dp = new int[N + 1, N + 1];
dp[0, a] = 1;
for (int i = 0;; i++)
{
if (dp[i, b] != 0)
{
WriteLine(dp[i, b]);
break;
}
for (int j = 0; j < N; j++)
{
for (int k = 0; k < g[j].Count; k++)
{
dp[i + 1, g[j][k]] = (dp[i + 1, g[j][k]] + dp[i, j]) % MOD;
}
}
}
}
public void Solve()
{
var cin = new MyInputStream();
var N = cin.ReadInt();
var M = cin.ReadInt();
var c = new int[M, N];
const int START = 0;
const int GOAL = -1;
const int IMPENETRABLE = -2;
Point s = new Point();
for (int y = 0; y < N; ++y)
{
var line = cin.Read();
for (int x = 0; x < M; ++x)
{
switch (line[x])
{
case 's':
s = new Point(x, y);
c[x, y] = START;
break;
case 'g':
c[x, y] = GOAL;
break;
case '#':
c[x, y] = IMPENETRABLE;
break;
default:
c[x, y] = (int)(line[x] - '0');
break;
}
}
}
var dxy = new[] { -1, 0, 1, 0, -1 };
Func <double, bool> Check = (brightness) =>
{
var visited = new bool[M, N];
var q = new Queue <Turn>();
q.Enqueue(new Turn(time: 1, bright: 10.0, pos: s));
while (q.Any())
{
var now = q.Dequeue();
if (now.b < brightness)
{
continue;
}
if (visited[now.p.X, now.p.Y])
{
continue;
}
visited[now.p.X, now.p.Y] = true;
for (int i = 0; i < 4; ++i)
{
var nx = now.p.X + dxy[i];
var ny = now.p.Y + dxy[i + 1];
if (nx < 0 || nx >= M)
{
continue;
}
if (ny < 0 || ny >= N)
{
continue;
}
if (visited[nx, ny])
{
continue;
}
if (c[nx, ny] == GOAL)
{
return(true);
}
if (c[nx, ny] <= 0)
{
continue;
}
var nb = Math.Min(Math.Pow(0.99, now.t) * c[nx, ny], now.b);
q.Enqueue(new Turn(now.t + 1, nb, new Point(nx, ny)));
}
}
return(false);
};
if (!Check(0))
{
WriteLine(-1);
return;
}
var l = 0d;
var r = 10d;
for (int i = 0; i < 50; ++i)
{
if (Math.Abs(r - l) < 1e-15)
{
break;
}
var mid = (l + r) / 2d;
if (Check(mid))
{
l = mid;
}
else
{
r = mid;
}
}
WriteLine(l);
}
public void Solve()
{
var cin = new MyInputStream();
var N = cin.ReadInt();
var M = cin.ReadInt();
var c = new int[N, M];
const int START = -1;
const int GOAL = -2;
const int INVALID = -3;
var sx = 0;
var sy = 0;
for (int i = 0; i < N; ++i)
{
var l = cin.Read();
for (int j = 0; j < M; ++j)
{
if (l[j] == 's')
{
sx = j;
sy = i;
c[i, j] = START;
}
else if (l[j] == 'g')
{
c[i, j] = GOAL;
}
else if (l[j] == '#')
{
c[i, j] = INVALID;
}
else
{
c[i, j] = l[j] - '0';
}
}
}
var table = new double[10, N *M + 1];
for (int i = 0; i <= N * M; ++i)
{
var brightness = Math.Pow(0.99, i);
for (int j = 1; j < 10; ++j)
{
table[j, i] = brightness * j;
}
}
var dxy = new int[] { 0, 1, 0, -1, 0 };
Func <double, bool> bfs = (bright) => {
var visited = new bool[M, N];
var pos = new Pair <Pair <int, int>, Pair <int, double> >(new Pair <int, int>(sx, sy), new Pair <int, double>(0, 10));
var q = new Queue <Pair <Pair <int, int>, Pair <int, double> > >();
q.Enqueue(pos);
while (q.Any())
{
var now = q.Dequeue();
var x = now.First.First;
var y = now.First.Second;
var t = now.Second.First;
var m = now.Second.Second;
if (m < bright)
{
continue;
}
if (visited[x, y])
{
continue;
}
else
{
visited[x, y] = true;
}
if (c[y, x] == GOAL)
{
return(true);
}
if (c[y, x] == INVALID)
{
continue;
}
for (int i = 0; i < 4; ++i)
{
int nx = x + dxy[i];
int ny = y + dxy[i + 1];
if (nx < 0 || nx >= M)
{
continue;
}
if (ny < 0 || ny >= N)
{
continue;
}
double min = (c[y, x] == START) ? 10 : Math.Min(m, table[c[y, x], t]);
var next = new Pair <Pair <int, int>, Pair <int, double> >(new Pair <int, int>(nx, ny), new Pair <int, double>(t + 1, min));
q.Enqueue(next);
}
}
return(false);
};
if (!bfs(0))
{
WriteLine("-1");
return;
}
double a = 0;
double b = 10;
while (Math.Abs(a - b) > 1e-10)
//for (int i = 0; i < 50; ++i)
{
double mid = (a + b) / 2.0;
if (bfs(mid))
{
a = mid;
}
else
{
b = mid;
}
}
Console.WriteLine(a.ToString("F10"));
}